tsp_fitness1.m

来自「用遗传算法求解TSP（旅行商）问题」· M 代码 · 共 14 行

function fitness = TSP_fitness(path,dist)

nPoint = size(path,2);
fitness = dist(path(nPoint),path(1));

for i=1:nPoint-1
    fitness = fitness + dist(path(i),path(i+1));
end % for...

return;