paint.m

来自「用于解决TSP问题的蚁群算法」· M 代码 · 共 58 行

%图形绘制

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

cla;

subplot(2,2,1);
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=tobu(min_pos,i);
    b=tobu(min_pos,i+1);
    line([pos(a,1),pos(b,1)],[pos(a,2),pos(b,2)]);
end

a=tobu(min_pos,city_n);
b=tobu(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(i);
    b=best_individual(i+1);
    line([pos(a,1),pos(b,1)],[pos(a,2),pos(b,2)]);
end

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

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

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