【FA TSP】萤火虫算法求解旅行商问题【含Matlab源码 328期】.zip

clear clc close all X=[16.47,96.10 16.47,94.44 20.09,92.54 22.39,93.37 25.23,97.24 22.00,96.05 20.47,97.02 17.20,96.29 16.30,97.38 14.05,98.12 16.53,97.38 21.52,95.59 19.41,97.13 20.09,92.55]; R=11; MAXGEN=200; NIND=100; D=Distanse(X); N=size(D,1); %%初始化种群 Chrom=InitPop(NIND,N); %%在二维图上画出所有坐标点 figure plot(X(:,1),X(:,2),'o'); %%画出随机解的路线图 DrawPath(Chrom(1,:),X); pause(0.0001) %%输出随机解的路线和总距离 disp('初始种群中的一个随机解：') OutputPath(Chrom(1,:)); Rlength=PathLength(D,Chrom(1,:)); disp(['总距离：',num2str(Rlength)]); disp('-------------------------------------------------------------------------------------------------') %%优化 gen=0; figure; hold on;box on xlim([0,MAXGEN]) title('优化过程') xlabel('代数') ylabel('最优值') ObjV=PathLength(D,Chrom); %计算路线长度title('优化过程')xlable('代数')ylable('最优值') preObjV=min(ObjV); while gen<MAXGEN %%计算适应度 ObjV=PathLength(D,Chrom); %计算路线长度 %fprintf('%d %1.10f\n',gen,min(ObjV)) line([gen-1,gen],[preObjV,min(ObjV)]);pause(0.0001) preObjV=min(ObjV); FitnV=Fitness(ObjV); for i=1:NIND K=0; subject=zeros(NIND,N); for j=1:i-1 dij=ristanse(Chrom(i,:),Chrom(j,:)); if dij<=R K=K+1; subject(K,:)=Chrom(j,:); end end for j=i+1:NIND dij=ristanse(Chrom(i,:),Chrom(j,:)); if dij<=R K=K+1; subject(K,:)=Chrom(j,:); end end if K==0 subject1=zeros(1,N); else subject1=zeros(K,N); end for v=1:K subject1(v,:)=subject(v,:); end if K~=0 ObjV1=PathLength(D,subject1); FitnVS=Fitness(ObjV1); [minObjV1,minInd]=min(ObjV1); minChrom=subject1(minInd,:); ObjVi=PathLength(D,Chrom(i,:)); if ObjVi>minObjV1 [Chrom(i,:),minChrom]=placechange(Chrom(i,:),minChrom); end end end gen=gen+1; end %%画出最优解的路线图 ObjV=PathLength(D,Chrom); [minObjV,minInd]=min(ObjV); DrawPath(Chrom(minInd(1),:),X) %%输出最优解的路线和总距离 disp('最优解') p=OutputPath(Chrom(minInd(1),:)); disp(['总距离:',num2str(ObjV(minInd(1)))]); disp('-------------------------------------------------------------------')