模拟退火算法及禁忌搜索算法的matlab源程序模拟退火算法及禁忌搜索算法的matlab源程序PAGE模拟退火算法及禁忌搜索算法的matlab源程序%%%模拟退火算法源程序%此题以中国31省会城市的最短旅行路径为例：%clear;clc;function[MinD,BestPath]=MainAneal(pn)%CityPosition存储的为每个城市的二维坐标x和y；CityPosition=[13042312;36391315;41772244;37121399;34881535;33261556;32381229;...41961044;4312790;4386570;30071970;25621756;27881491;23811676;...1332695;37151678;39182179;40612370;37802212;36762578;40292838;...42632931;34291908;35072376;33942643;34393201;29353240;31403550;...25452357;27782826;23702975];figure(1);plot(CityPosition(:,1),CityPosition(:,2),'o')m=size(CityPosition,1);%城市的数目%D=sqrt((CityPosition(:,ones(1,m))-CityPosition(:,ones(1,m))').^2+...(CityPosition(:,2*ones(1,m))-CityPosition(:,2*ones(1,m))').^2);path=zeros(pn,m);fori=1:pnpath(i,:)=randperm(m);enditer_max=100;%im_max=5;%Len1=zeros(1,pn);Len2=zeros(1,pn);path2=zeros(pn,m);t=zeros(1,pn);T=1e5;tau=1e-5;N=1;whileT>=tauiter_num=1;m_num=1;whilem_num
R)~=0)path(find((Len2-Len1R)~=0),:)=path2(find((Len2-Len1R)~=0),:);%#okLen1(find((Len2-Len1R)~=0))=Len2(find((Len2-Len1R)~=0));[TempMinD,TempIndex]=min(Len1);TracePath(N,:)=path(TempIndex,:);%#okDistance(N)=TempMinD;%#okN=N+1;elsem_num=m_num+1;endenditer_num=iter_num+1;T=T*;end[MinD,Index]=min(Distance);BestPath=TracePath(Index,:);%disp(MinD)%画出路线图figure(2);plot(CityPosition(BestPath(1:end-1),1),CityPosition(BestPath(1:end-1),2),'r*-');functionp2=ChangePath2(p1,CityNum)while(1)R=unidrnd(CityNum,1,2);ifabs(R(1)-R(2))>0break;endendI=R(1);J=R(2);ifICityNum*(CityNum-1)/2disp('候选解个数不大于n*(n-1)/2!');break;endALong(p)=Fun(dislist,S0);i=1;A=zeros(Candidates,2);whilei<=CandidatesM=CityNum*rand(1,2);M=ceil(M);ifM(1)~=M(2)A(i,1)=max(M(1),M(2));A(i,2)=min(M(1),M(2));ifi==1isa=0;elseforj=1:i-1ifA(i,1)==A(j,1)&&A(i,2)==A(j,2)isa=1;break;elseisa=0;endendendif~isai=i+1;elseendelseendendBestCandidateNum=100;%保留前BestCandidateNum个最好候选解BestCandidate=Inf*ones(BestCandidateNum,4);F=zeros(1,Candidates);fori=1:CandidatesCandidateNum(i,:)=S0;CandidateNum(i,[A(i,2),A(i,1)])=S0([A(i,1),A(i,2)]);F(i)=Fun(dislist,CandidateNum(i,:));ifi<=BestCandidateNumBestCandidate(i,2)=F(i);BestCandidate(i,1)=i;BestCandidate(i,3)=S0(A(i,1));BestCandidate(i,4)=S0(A(i,2));elseforj=1:BestCandidateNumifF(i)fori=1:CityNum-1plot([Clist(BSF(i),1),Clist(BSF(i+1),1)],[Clist(BSF(i),2),Clist(BSF(i+1),2)],'bo-');holdon;endplot([Clist(BSF(CityNum),1),Clist(BSF(1),1)],[Clist(BSF(CityNum),2),Clist(BSF(1),2)],'ro-');title(['Counter:',int2str(p*Candidates),'TheMinDistance:',num2str(BestL)]);holdoff;pause;ifget(stop,'value')==1break;endendtoc;BestShortcut=BSF;theMinDistance=BestL;set(stop,'style','pushbutton','string',…'close','callback','close(gcf)');figure(2);plot(ArrBestL,'r');holdon;plot(ALong,'b');grid;title('搜索过程');legend('BestSoFar','当前解');endfunctionF=Fun(dislist,s)%#okDistanV=0;n=size(s,2);fori=1:(n-1)DistanV=DistanV+dislist(s(i),s(i+1));endDistanV=DistanV+dislist(s(n),s(1));F=DistanV;end
浙公网安备 33021202002483