tspsa.m

tsp（旅行商问题） 利用matlab遗传算法、模拟退火算法以及lingo动态规划求解

locations=[1304 2312;3639 1315;4177 2244;3712 1399;3488 1535;3326 1556;
                3238 1229;4196 1044;4312  790;4386  570;3007 1970;2562 1756];
n= size(locations,1);%n表示问题的规模（城市个数）
d = zeros(n);
for count1=1:n,
    for count2=1:count1,
        x1 = locations(count1,1);
        y1 = locations(count1,2);
        x2 = locations(count2,1);
        y2 = locations(count2,2);
        d(count1,count2)=sqrt((x1-x2)^2+(y1-y2)^2);
        d(count2,count1)=d(count1,count2);
    end;
end;
t0=40; tf=0.1;
[f,T]=trp(d,t0,tf)