output.m

旅行商问题的IAGA算法。好象很不错的程序。matlab编写的

function [bestpath,minpathlong]=Output(path,TSPMatrix,Popsize)
%输出
FP=Fitness(path,TSPMatrix);
[row,col]=size(path);
[tempFP,index]=max(FP);
bestpath=path(index,:);
minpathlong=0;
for i=1:col-1
    minpathlong=TSPMatrix(bestpath(i),bestpath(i+1))+minpathlong;
end
minpathlong=TSPMatrix(bestpath(i+1),bestpath(1))+minpathlong;