完整可以运行的数值优化遗传算法源代码
y1=find(r<pCross);
y2=find(r>=pCross);
len=length(y1);
if len==1|(len>2&mod(len,2)==1)%如果用来进行交叉的染色体的条数为奇数,将其调整为偶数
y2(length(y2)+1)=y1(len);
y1(len)=[];
end
i=0;
if length(y1)>=2
if opts(1)==1%浮点编码交叉
while(i<=length(y1)-2)
NewPop(y1(i+1),:)=OldPop(y1(i+1),:);
NewPop(y1(i+2),:)=OldPop(y1(i+2),:);
if opts(2)==0&n>1%discret crossover
Points=sort(unidrnd(n,1,2));
NewPop(y1(i+1),Points(1):Points(2))=OldPop(y1(i+2),Points(1):Points(2));
NewPop(y1(i+2),Points(1):Points(2))=OldPop(y1(i+1),Points(1):Points(2));
elseif opts(2)==1%arithmetical crossover
Points=round(unifrnd(0,pCross,1,n));
CrossPoints=find(Points==1);
r=rand(1,length(CrossPoints));
NewPop(y1(i+1),CrossPoints)=r.*OldPop(y1(i+1),CrossPoints)+(1-r).*OldPop(y1(i+2),CrossPoints); NewPop(y1(i+2),CrossPoints)=r.*OldPop(y1(i+2),CrossPoints)+(1-r).*OldPop(y1(i+1),CrossPoints); else %AEA recombination
Points=round(unifrnd(0,pCross,1,n));
CrossPoints=find(Points==1);
v=unidrnd(4,1,2);
NewPop(y1(i+1),CrossPoints)=(floor(10^v(1)*OldPop(y1(i+1),CrossPoints))+...
10^v(1)*OldPop(y1(i+2),CrossPoints)-floor(10^v(1)*OldPop(y1(i+2),CrossPoints)))/10^v(1);
NewPop(y1(i+2),CrossPoints)=(floor(10^v(2)*OldPop(y1(i+2),CrossPoints))+...
10^v(2)*OldPop(y1(i+1),CrossPoints)-floor(10^v(2)*OldPop(y1(i+1),CrossPoints)))/10^v(2);
end
i=i+2;
end
elseif opts(1)==0%二进制编码交叉
while(i<=length(y1)-2)
if opts(2)==0
[NewPop(y1(i+1),:),NewPop(y1(i+2),:)]=EqualCrossOver(OldPop(y1(i+1),:),OldPop(y1(i+2),:)); else
[NewPop(y1(i+1),:),NewPop(y1(i+2),:)]=MultiPointCross(OldPop(y1(i+1),:),OldPop(y1(i+2),:)); end
i=i+2;
end
else %Tsp问题次序杂交
for i=0:2:length(y1)-2
xPoints=sort(unidrnd(n,1,2));
NewPop([y1(i+1) y1(i+2)],xPoints(1):xPoints(2))=OldPop([y1(i+2) y1(i+1)],xPoints(1):xPoints(2));
百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读,免费范文网,提供经典小说教育文库遗传算法Matlab源代码(6)在线全文阅读。
相关推荐: