蚁群算法求解TSP问题MATLAB程序.docVIP

%% 蚁群算法¨ clear close clc n = 10; % 城市数量 m = 100; % 蚂蚁数量 alfa = 1.5; beta = 2.5; rho = 0.1; Q = 1000; maxgen = 50; x = [2 14 9 6 3 2 4 8 12 5]; y = [8 9 12 4 1 2 5 8 1 15]; % x = [37,49,52,20,40,21,17,31,52,51,42,31,5,12,36,52,27,17,13,57,62,42,16,8,7,27,30,43,58,58,37,38,46,61,62,63,32,45,59,5,10,21,5,30,39,32,25,25,48,56,30]; % y = [52,49,64,26,30,47,63,62,33,21,41,32,25,42,16,41,23,33,13,58,42,57,57,52,38,68,48,67,48,27,69,46,10,33,63,69,22,35,15,6,17,10,64,15,10,39,32,55,28,37,40]; City = [x,y]; % 城市坐标 %% 城市之间的距离 for i = 1:n D(i,:) = ((City(i,1) - City(:,1)).^2 + (City(i,2) - City(:,