vrp matlab 论坛,蚁群算法求解VRP问题

function [ output_args ] = nuli( input_args )

m=60;

Alpha=1;

Beta=1;

gama=2;

Rho=0.15;

NC_max=100;

Q=15;

W=9;

qq=0.5;

C=[31.2961 121.1702

31.3233 121.201

31.2803     121.1650

31.3362     121.1941

31.2802     121.1644

31.2850     121.300

31.3601     121.1610

31.3102     121.240

31.3041     121.186

31.2962     121.174

31.3108     121.207

31.3701     121.4238

31.279      121.186

31.233      121.401

31.3029     121.1627

31.3595     121.139

31.3108     121.143

31.111      121.165

31.3904     121.169

31.257      121.241

31.313      121.192

31.316      121.185

31.3014     121.1516

31.2882     121.1634

31.2888     121.1621

31.2805     121.1650

31.3123     121.240

31.325325   121.48808

31.293      121.194

31.286      121.185

31.303      121.159

31.2944     121.163

31.2950     121.1869

31.2456     121.1123

31.3604     121.136

31.3252     121.165

31.314      121.219

31.2951     121.1614

31.2727     121.213

31.2964     121.177

31.3429     121.165

31.281      121.240

31.3184     121.1670];

t = [

0

0.11985

9.605745

5.323856

11.51265

56.918812

0.74052

23.92739

0.9856

5.52384

0.136125

5.5854

6.13548

0.235645

34.99731

0.4725

0.111384

17.33181075

0.44652

38.13191

1.264522875

0.0546

3.665288

26.334

6.126981

8.6374

1.4472

1.05096

6.826613

3.12988

14.556846

12.96828

9.868595

10.856

6.99199

42.60458025

17.433696

0.03552

22.974166

2.9568

29.39325425

2.976768

2.79584

];

n=size(C,1);

D=zeros(n,n);

for i=1:n-1

D(i,i)=eps;

for j=1:i+1

D(i,j)=((C(i,1)-C(j,1))^2+(C(i,2)-C(j,2)^2)^2)^0.5;

D(j,i)=D(i,j);

end

end

D(n,n)=eps;

U=zeros(n,n);

for i=1:n

U(i,i)=eps;

for j=1:n

if i

U(i,j)=D(i,1)+D(j,1)-D(i,j);

end

U(j,i)=U(i,j);

end

end

U(n,n)=eps;

load_w=0;

Eta=1./D;

Tau=ones(n,n);

Tabu=zeros(m,n+1);

NC=1;

G_best_route=[NC_max,n];

G_best_length=inf.*ones(NC_max,1);

length_ave=zeros(NC_max,1);

while NC<=NC_max

Randpos=[];

for i=1:(ceil(m/n));

Randpos=[Randpos,randperm(n)];

end

Tabu(:,1)=(Randpos(1,1:m))';

for i=1:m

visited=Tabu(i, :);

visited=visited(visited>0);

to_visit=setdiff(1:n,visited);

c_temp=length(to_visit);

X=zeros(1,c_temp);

j=2;

while j<=n

if~isempty(to_visit)

for k=1:length(to_visit)

X(k)=(Tau(visited(end),to_visit(k))^Alpha)*(Eta(visited(end),to_visit(k))^Beta)*(U(visited(end),to_visit(k))^gama);

end

ww=rand;

if ww

Select=find(max(X));

else

X=X/(sum(X));

xcum=cumsum(X);

Select=find(max(xcum));

end

if isempty(Select)

Select=1;

end

Tabu(i,length(visited))=to_visit(Select(1));

load_w=load_w+t(to_visit(Select));

if load_w>W

load_w=0;

end

end

visited=Tabu(i,:);

visited=visited(visited>0);

to_visit=setdiff(1:n,visited);

c_temp=length(to_visit);

X=zeros(1,c_temp);

if visited(end)~=1

Tabu(i,1:(length(visited)+1))=[visited,1];

end

j=j+1;

end

end

L=zeros(m,1);

for i=1:m

MM=Tabu(i,:);

R=MM(MM>0);

for j=1:(length(R)-1)

L(i)=L(i)+D(R(j),R(j+1));

end

end

G_best_length(NC)=min(L);

pos=find(L==G_best_length(NC));

G_best_route(NC,1:length(Tabu(pos(1),:)))=Tabu(pos(1),:);

select=find(G_best_route(NC,:)==1);

FF=[];

LM=0;

for a=1:(length(select)-1)

y_G_best_route=G_best_route(NC,select(a):select(a+1));

al=length(y_G_best_route);

T=zeros((length(select)-1),1);

for d=1:(al-1)

T(a)=T(a)+D(y_G_best_route(d),y_G_best_route(d+1));

end

for b=2:(al-1)

for c=(b+1):(al-1)

DD=y_G_best_route;

temp1=DD(b);

temp2=DD(c);

DD(b)=temp2;

DD(c)=temp1;

TT=zeros(1);

for d=1:(al-1)

TT=TT+D(DD(d),DD(d+1));

end

if TT

T(a)=TT;

y_G_best_route=DD;

end

end

end

if a>=2

y_G_best_route=y_G_best_route(2:al);

end

FF=[FF,y_G_best_route];

LM=LM+T(a);

end

G_best_length(NC)=LM;

G_best_route(NC,1:length(FF))=FF;

FF=[];

LM=0;

Delta_Tau=zeros(n,n);

for i=1:m

MM=Tabu(i,:);

R=MM(MM>0);

for j=1:(length(R)-1)

Delta_Tau(R(j),R(j+1))=Delta_Tau(R(j),R(j+1))+Q/L(i);

end

end

Tau=(1-Rho).*Tau+Delta_Tau;

Tabu=zeros(m,n);

load_w=0;

NC=NC+1;

Pos=find(G_best_length==min(G_best_length));

Shortest_Route=G_best_route(Pos(1),:)

Shortest_Length=G_best_length(Pos(1))

subplot(1,2,1)

DrawRoute(C,Shortest_Route)

subplot(1,2,2)

plot(L_best)

hold on

plot(L_ave)

%NULI Summary of this function goes here

%   Detailed explanation goes here

end

我把程序改了下，可以运行，可是为什么只能排序到22个城市，后面的路径顺序点显示的都是零