程序一主程序.doc

程序一：主程序%TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序%D是距离矩阵，n为种群个数%参数a是中国31个城市的坐标%C为停止代数，遗传到第 C代时程序停止,C的具体取值视问题的规模和耗费的时间而定%m为适应值归一化淘汰加速指数,最好取为1,2,3,4,不宜太大%alpha为淘汰保护指数,可取为0~1之间任意小数,取1时关闭保护功能,建议取0.8~1.0之间的值%R为最短路径,Rlength为路径长度function [R,Rlength]=geneticTSP(D,a,n,C,m,alpha)[N,NN]=size(D);farm=zeros(n,N);%用于存储种群for i=1:n??? farm(i,:)=randperm(N);%随机生成初始种群endR=farm(1,:);subplot(1,3,1)scatter(a(:,1),a(:,2),x)pause(1)subplot(1,3,2)plotaiwa(a,R)pause(1)farm(1,:)=R;len=zeros(n,1);%存储路径长度fitness=zeros(n,1);%存储归一化适应值counter=0;while counter??? for i=1:n??????? len(i,1)=myLength(D,farm(i,:));%计算路径长度??? end??? maxlen=max(len);??? minlen=min(len);??? fitness=fit(len,m,maxlen,minlen);%计算归一化适应值??? rr=find(len==minlen);??? R=farm(rr(1,1),:);%更新最短路径?????? FARM=farm;%优胜劣汰，nn记录了复制的个数??? nn=0;??? for i=1:n??????? if fitness(i,1)=alpha*rand??????????? nn=nn+1;??????????? FARM(nn,:)=farm(i,:);??????? end??? end??? FARM=FARM(1:nn,:);?????? [aa,bb]=size(FARM);%交叉和变异??? while aa??????? if nn=2??????????? nnper=randperm(2);??????? else??????????? nnper=randperm(nn);??????? end??????? A=FARM(nnper(1),:);??????? B=FARM(nnper(2),:);??????? [A,B]=intercross(A,B);??????? FARM=[FARM;A;B];??????? [aa,bb]=size(FARM);??? end??? if aan??????? FARM=FARM(1:n,:);%保持种群规模为n??? end?????? farm=FARM;??? clear FARM??? counter=counter+1???endRlength=myLength(D,R);subplot(1,3,3)plotaiwa(a,R) 程序二：计算邻接矩阵%输入参数a是中国31个城市的坐标%输出参数D是无向图的赋权邻接矩阵function D=ff01(a)[c,d]=size(a);D=zeros(c,c);for i=1:c??? for j=i:c??????? bb=(a(i,1)-a(j,1)).^2+(a(i,2)-a(j,2)).^2;??????? D(i,j)=bb^(0.5);??????? D(j,i)=D(i,j);??? endend 程序三：计算归一化适应值%计算归一化适应值的子程序function fitness=fit(len,m,maxlen,minlen)fitness=len;for i=1:length(len)??? fitness(i,1)=(1-((len(i,1)-minlen)/(maxlen-minlen+0.0001))).^m;end 程序四：交叉和变异的子程序%交叉算法采用的是由Goldberg和Lingle于1985年提出的PMX(部分匹配交叉)function [a,b]=intercross(a,b)L=length(a);if L=10%确定交叉宽度??? W=9;elseif ((L/10)-floor(L/10))=randL10??? W=cei