bestobj.m

来自「免疫遗传算法用于搜索全局最优解,经验证具有很好的效率和收敛性」· M 代码 · 共 20 行

% 函数 - 计算最佳个体的适应度
function bestobj(bestpop,d,outfp)

totlelen = 0;
for i = 1:length(bestpop)-1    
    totlelen = totlelen + d(bestpop(i),bestpop(i+1)); 
end
totlelen = totlelen + d(bestpop(1),bestpop(length(bestpop)));

aisfit = 100/totlelen-2;
fprintf(outfp,'    最佳个体的总路径长度      = %8.2f\n',totlelen);

% 输出最佳个体
fprintf(outfp,'\n  最佳个体为：\n');
fprintf(outfp,'[');
for i = 1:length(bestpop)
    fprintf(outfp,'%3.0f',bestpop(i));
end
fprintf(outfp,']');