蚁群算法-求解TSP问题
转自: https://www.cnblogs.com/twzh123456/p/11798800.html
%% 导入数据
%load citys_data.mat
city = ceil(rand(50,2) * 5000)
load city.mat
%% 计算城市间相互距离
fprintf('Computing Distance Matrix... \n');
n = size(city,1);
D = zeros(n,n);
for i = 1:n
for j = 1:n
if i ~= j
D(i,j) = sqrt(sum((city(i,:) - city(j,:)).^2));
else
D(i,j) = 1e-4;
end
end
end
, 相关下载链接:
https://download.csdn.net/download/Karamazov_/87377928?utm_source=bbsseo