assign_distmatrix1.m

实现了一种高效的蚁群算法,它在旅行商问题中进行了测试

%this code is written by Liangju Ke
%please refer to the paper "有限级信息素蚁群算法"

function distmatrix = assign_distmatrix1(MAX_CITY_NUMBER)

% NAME : eil51
% COMMENT : 51-city problem (Christofides/Eilon)
% TYPE : TSP
% DIMENSION : 51
% EDGE_WEIGHT_TYPE : EUC_2D
% NODE_COORD_SECTION

point = [37 52;...
        49 49;...
        52 64;...
        20 26;...
        40 30;...
        21 47;...
        17 63;...
        31 62;...
        52 33;...
        51 21;...
        42 41;...
        31 32;...
        5 25;...
        12 42;...
        36 16;...
        52 41;...
        27 23;...
        17 33;...
        13 13;...
        57 58;...
        62 42;...
        42 57;...
        16 57;...
        8 52;...
        7 38;...
        27 68;...
        30 48;...
        43 67;...
        58 48;...
        58 27;...
        37 69;...
        38 46;...
        46 10;...
        61 33;...
        62 63;...
        63 69;...
        32 22;...
        45 35;...
        59 15;...
        5 6;...
        10 17;...
        21 10;...
        5 64;...
        30 15;...
        39 10;...
        32 39;...
        25 32;...
        25 55;...
        48 28;...
        56 37;...
        30 40];


for i=2:MAX_CITY_NUMBER	
    for j=1:i-1
       % distmatrix(i,j) = sqrt((point(i,1)-point(j,1))^2+(point(i,2)-point(j,2))^2);	  
       distmatrix(i,j) = round(sqrt((point(i,1)-point(j,1))^2+(point(i,2)-point(j,2))^2));	  
        distmatrix(j,i) = distmatrix(i,j);
    end
end

return;