untitled2.asv

TSP问题,即旅行商问题,matlab环境下可以运行

x0 =[1     6     0     0
     1     8     5    10
     1     3     0     0
     3     9     2     0
     1     4     0     0
     1     7     0     0
     1     1     0     0];


l0 =[1     3     1     2     1     1     1];

x0 =[1     6     0     0
     1     8     5    10
     1     3     0     0
     3     9     2     0
     1     4     0     0
     1     7     0     0
     1     1     0     0];


l0 =[1     3     1     2     1     1     1];
tabu=zeros(7,length(x0(:)));
tabu=updatetabu(x0,tabu);


demand=[142 85 385
       163 175 430
        87 96 540
        63 57 324
        204 217 238
        130 165 296
        180 210 340
        93 114 286
        170 163 392
        78 103 310
        50 148 0
        34 82 0
        185 198 0]; 
    
    NumberRoute=length(l0);
    
  a=ceil(NumberRoute*rand);
  a
    l0(a)+1
    x0(a,2:l0(a)+1)
    
    sum1=0;sum2=0;sum3=0;
    for j=2:l0(a)+1
        sum1=demand(x0(a,j),1)*demand(x0(a,j),3)+sum1;
        sum2=demand(x0(a,j),3)+sum2;
         sum3=demand(x0(a,j),2)*demand(x0(a,j),3)+sum3;
    end
      xcenter=sum1/sum2;
      ycenter=sum3/sum2;