untitled.m

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

global customer;
global depot;
global demand;
global bestx;
global bestl;
global bestSC;
customer=10;
depot=3;
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];    
    
    
    
x0=zeros(customer,2);
l0=zeros(1,customer);
%计算需求点和配送中心之间的距离
for j=1:depot
    for k=1:customer
        Dd(k,j)=sqrt((demand(k,1)-demand(j+customer,1))^2+(demand(k,2)-demand(j+customer,2))^2);
    end
end
for i=1:customer
   x0(i,2)=i;
   l0(i)=1;
   [dis,n]=min(Dd(i,:));
   x0(i,1)=n;
end


x0
l0
 x0(1,1:4)=[1 8 0 0 ];
    x0(2,1:4)=[2 1 3 0];
    x0(3,1:4)=[2 4 10 0];
    x0(4,1:4)=[3 2 5 6];
    x0(5,1:4)=[3 7 9 0]
    l0(1)=1;
    l0(2)=2;
    l0(3)=2;
    l0(4)=3;
    l0(5)=2;
    
    x =[1     1
     2     2
     1     3
     1     4
     2     5
     2     7
     1     6
     1     8
     2     9
     2    10];


l=[1     1     1     1     1     1     1     1     1     1];
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];    
    changex=[3 4 5];
    
    newroute
    
    x1 =

     1     1     7
     1    10     0
     1     9     0
     1     8     0
     1     6     0
     2     4     0
     1     5     0
     1     3     0
     1     2     0


l1 =

     1     1     1     1     1     1     1     1     1
     
     x1 =

     1     3     0     0
     1     1     0     0
     1     8     0     0
     1     2     4     6
     1     9     0     0
     1    10     0     0
     1     5     0     0


l1 =

     1     1     1     2     1     1     1


inner_count =

     6


ans =

routing


ans =

newroute


x1 =

     1     3     0
     1     1     0
     1     8     0
     1     2     4
     1     9     0
     1     5     0
     1    10     0

     
       if outer==1
            T=T*r;  
           outer=outer+1;
    else 
           %solution
           %outer
            avge=mean(solution(outer,:));
             news=solution(1:outer-1,:);
            avgf=mean(mean(news));
           % avge 
          %  avgf
            if ((avge-avgf)/avgf)<=0.05
                
                
                 end  %接受解的个数达到要求
    count
    if outer==1
            T=T*r;  
           outer=outer+1;
    else 
         %  solution
         %  outer
            avge=mean(solution(outer,:));
             news=solution(1:outer-1,:);
            avgf=mean(mean(news));
            %avge 
            %avgf
            if ((avge-avgf)/avgf)<=0.05
              T=T*r;  
              outer=outer+1;
            end
     end