paint.m

来自「一个一群算法求解TSP问题的很好的粒子」· M 代码 · 共 44 行

%图形绘制

cla;

subplot(2,2,1);
for i=1:city_n
    plot(pos(i,1),pos(i,2),'.');hold on;
end
hold off;
for i=1:(city_n-1)
    a=tobu_A(min_pos,i);
    b=tobu_A(min_pos,i+1);
    line([pos(a,1),pos(b,1)],[pos(a,2),pos(b,2)]);
end

a=tobu_A(min_pos,city_n);
b=tobu_A(min_pos,1);
line([pos(a,1),pos(b,1)],[pos(a,2),pos(b,2)]);




subplot(2,2,2);
for i=1:city_n
    plot(pos(i,1),pos(i,2),'o');hold on;
end
hold off;
for i=1:(city_n-1)
    a=best_individual_A(i);
    b=best_individual_A(i+1);
    line([pos(a,1),pos(b,1)],[pos(a,2),pos(b,2)]);
end

a=best_individual_A(city_n);
b=best_individual_A(1);
line([pos(a,1),pos(b,1)],[pos(a,2),pos(b,2)]);

subplot(2,2,3);
plot(adapt_ave_A);

subplot(2,2,4);
plot(adapt_best_A);