蟻群算法Delphi源程序：{*AntalgorithmforVRP—Antcycle,Antdensity,Antquantity*}constinf=99999999;eps=1E-8typeitem=integer;varFN:string;f:System.Text;procedureT_VRPANT_RUN;constmaxn=500;ruo=0.7;Q=10;labelloop;typeitem2=real;Arr1=arrayofarrayofitem;Arr2=arrayofarrayofitem2;Arr3=arrayofarrayofboolean;Arr4=arrayofarrayofitem;Arr5=arrayofarrayofitem2;varn,i,j,k,l,ii,jj,count,s,maxcount,tweight,index,model,qq,capa,m,Last,selected,tm,weight:item;tmax,tmin:item2;datatype:byte;W,route,opt,cycle:arrl;t,dt:arr2;ch:arr3;x,y:arr5;Len,tlen,nearest,series,demand,kcount,tkcount:arr4;functionPValue(i,j,k:item):item2var1:item;sum:item2;beginSum:=0;For1:=2tondoIf(capa>demand[1])and(ch[1]and(cycle[k,l]=0)and(1<>i)thenSum:=sum+t[i,1]/w[i,l];If(sum>eps)and(cycle[k,j]=0)and(j<>i)thenSun:t[i,j]/w[i,l]/sumPValue:=sum;end;procedureTwoOpt(p:item)；varahead,i,i1,i2,index,j,j1,j2,last,limit,max,next,s1,s2,t1,t2,maxtemp:item;pt:arr4;beginsetLength(ph,n+1);t1:=1;t2:=1;sl:=1;s2:=1;forI:=1top-1dopt[route[k,i]:=route[k,i+1];pt[route[k,p]:=route[k,l];repeatmaxtemp:=0;i1:=1;fori:=1top-2dobeginifi=1thenlimit:=p-1elselimit:=p;i2:=pt[i1];j1:=pt[i2];forj:=i+2tolimitdobeginj2:=pt[j1]max:=w[i1,i2]+w[j1,j2]-(w[i1,j1]=+w[i2,j2]);if(max>maxtemp)thenbegins1:=i1;s2:=i2;t1=j1;t2=j2;maxtemp:=max;end;j1:=j2;end;i1:=i2;end;if(maxtemp>0)thenbeginpt[s1]:=t1;next:=s2;last:=t2;repeatahead:=pt[next];pt[next]:=last;last:=next;next:=ahead;untilnext=t2;end;until(maxtemp=0);index:=1;fori:=1topdobeginroute[k,i]:=index;index:=pt[index];end;end;procedureAntmove;labellop,select,check,next;vara,j,k:item;begink:=1;capa:=qq;last:=n-1;forj:=1tolastdoseries[j]:=j+1;forj:=1tolastdoch[j]:=trueforj:=1tolastdokcount[j]:=0;lop:nearest[k]:=1;forj:=1tondocycle[k,j]:=0;select:a:=nearest[k];j:=1;whilej<=lastdobeginindex:=0;selected:=random(last)+1;if(capa>=demand[series[selected]])thenbeginindex:=series[selected];if(random<PValue(a,index,k))thengotocheck;index:=series[selected];end;j:=j+1;end;ifindex=0thengotonext;check:cycle[k,nearest[k]]:=index;nearest[k]:=cysle[k,nearest[k]];ch[index]:=false;capa:=capa-demand[index];kcount[k]:=kcountt[k]+1;last:=last-1;forj:=selectedtolastdoseries[j]:=series[j+1];iflast>=1thengotoselect;next:iflast>=1then;begink:=k+1;capa:=qq;gotolop;end;m:=k;end;beginAssignFile(f,FN);Reset(f);{$I-}Readln(f,n,datatype,qq,maxcount);{$I+}If(IOResult<>0)or(n<4)or(n>maxn)or(maxcount<1)or(datatype<1)or(datatype>2)or(qq<=0)thenbeginShowMessage(‘數(shù)據(jù)錯誤');System.Close(f);exit;end;SetLength(t,n+1,n+1);SetLength(dt,n+1,n+1);SetLength(w,n+1,n+1);SetLength(opt,n+1,n+1);SetLength(route,n+1,n+1);SetLength(cycle,n+1,n+1);Ifdatatype=1thenbeginSetLength(x,n+1);SetLength(y,n+1);fori:=1tondobegin{$I-}Readln(f,ii,x[i],y[i]);{$I+}If(IOResult<>0)or(ii<>i)thenBeginShowMessage(‘數(shù)據(jù)錯誤');System.Close(f);exit;end;end;fori:=1ton-1doforj:=i+1tondobeginw[i,j]:=trunc(sprt(spr(x[i]-x[j])+spr(y[i]-y[j]))+0.5);w[j,i]:=w[i,j];t[i,j]:=1;dt[i,j]:=0;t[j,i]:=t[i,j];dt[j,i]:=dt[i,j];end;fori:=1tondobeginw[i,i]:=inf;t[i,i]:=1;dt[i,i]:=0;end;SetLength(x,0);SetLength(y,0);endelsebeginfori:=1ton-1doforj:=i+1tondobegin{$I-}Readln(f,ii,jj,w[i,j]);{$I+}If(IOResult<>0)or(ii<>i)or(jj<>j)or(w[i,j]<1)thenbeginShowMessage(‘數(shù)據(jù)錯誤');System.Close(f);exit;end;w[j,i]:=w[i,j];t[i,j]:=1;dt[i,j]:=0;t[j,i]:=t[i,j];dt[j,i]:=dt[i,j];end;fori:=1tondobeginw[i,i]:=inf;t[i,i]:=1;dt[i,i]=0;end;end;SetLength(len,n+1);SetLength(tlen,n+1);SetLength(series,n+1);SetLength(nearest,n+1);SetLength(tkcount,n+1,n+1);SetLength(demand,n+1);SetLength(kcount,n+1);SetLength(ch,n+1);demand[1]:=0;fori:=2tondobegin{$I-}Readln(f,ii,demand[i];{$I+}If(IOResult<>0)or(ii<>i)or(demand[i]>qq)or(demand[i]<0)thenbeginShowMessage(‘數(shù)據(jù)錯誤');System.Close(f);exit;end;endSystem.Close(f);FN:=Copy(FN,1,Length(FN)-4)+'.OUT';ShowMessage('輸出結果存入文件：'+FN);AssignFile(f,FN);Rewrite(f);count:=0;tweight:=inf;index:=1;tm:=inf;randomize;model:=random(3)+1;1oop:AntMove;weight:=0;fork:=1tomdolen[k]:=0;fork:=1tomdobeginindex:=1;fori:=1tokcount[k]+1dobeginroute[k,i]:=index;index:=cycle[k,index];end;TwoOpt(kcount[k]+1);Len[k]:=w[route[k,kcount[k]+1],route[k,1]];fori:=1tokcount[k]dolen[k]:=len[k]+w[route[k,i],route[k,i+1]];weight:=weight+len[k];end;ifm<tmthenbegintm:=m;tweight:=weight;fork:=1totmdobegintkcount[k]:=kcount[k];forj:=1totkcount[k]+1doopt[k,j]:=route[k,j];tlen[k]:=len[k];end;end;ifm=tmtheniftweight>weightthenbegintweight:=weight;fork:=1totmdobegintkcount[k]:=kcount[k];forj:=1totkcount[k]+1doopt[k,j]:=route[k,j];tlen[k]:=len[k];end;end;fork:=1totmdobegincasemodelof1:beginfor1:=1tokcount[k]dobeginii:=route[k,l];jj=route[k,1+1];dt[ii,jj]:=dt[ii,jj]+q/len[k];end;ii:=route[k,kcount[k]+1];jj=route[k,1];dt[ii,jj]:=dt[ii,jj]+q/len[k];end;2:beginfor1:=1tokcount[k]dobeginii:=route[k,l];jj:=route[k,1+1];dt[ii,jj]:=dt[ii,jj]+q;end;ii:=route[k,kcount[k]+1];jj:=route[k,1];dt[ii,jj]:=dt[ii,jj]+q;end;3:beginfor1:=1tokcount[k]dobeginii:=route[k,1];jj:=route[k,l+1]dt[ii,jj]:=dt[ii,jj]+q/w[ii,jj];end;ii:=route[k,kcount[k]+1];jj:=route[k,1];dt[ii,jj]:=dt[ii,jj]+q/w[ii,jj];endendend;fori:=1tondoforj:=1tondobegint[i,j]:=ruo*t[i,j]+dt[i,j];tmax:=1/(tweight*(1-ruo);tmin=tmax/5;if(t[i,j]>tmax)thent[i,j]:=tmax;if(t[i,j]<tmin)thent[i,j]:=tmin;end;count:=count+1;fori:=1tondoforj:=1tondodt[i,j]:=0;ifcount<