完整可以运行的数值优化遗传算法源代码
NewPop(MutIn(i),k(j))=1;
end
end
i=i+1;
end
end
else%Tsp变异
if opts(2)==1|opts(2)==2|opts(2)==3|opts(2)==4
numMut=ceil(pMutation*m);
r=unidrnd(m,numMut,2);
[LocalMinfit,In]=min(fit(r),[],2);
SelectIn=r((In-1)*numMut+[1:numMut]');
while(i<=numMut)
mPoints=sort(unidrnd(n,1,2));
if mPoints(1)~=mPoints(2)
NewPop(SelectIn(i),1:mPoints(1)-1)=OldPop(SelectIn(i),1:mPoints(1)-1);
NewPop(SelectIn(i),mPoints(1):mPoints(2)-1)=OldPop(SelectIn(i),mPoints(1)+1:mPoints(2)); NewPop(SelectIn(i),mPoints(2))=OldPop(SelectIn(i),mPoints(1));
NewPop(SelectIn(i),mPoints(2)+1:n)=OldPop(SelectIn(i),mPoints(2)+1:n);
else
NewPop(SelectIn(i),:)=OldPop(SelectIn(i),:);
end
i=i+1;
end
else
r=rand(1,m);
MutIn=find(r<=pMutation);
L=length(MutIn);
while i<=L
mPoints=sort(unidrnd(n,1,2));
rIn=randperm(mPoints(2)-mPoints(1)+1);
NewPop(MutIn(i),mPoints(1):mPoints(2))=OldPop(MutIn(i),mPoints(1)+rIn-1);
i=i+1;
end
end
end
% -- 倒位操作 --
function [NewPop]=Inversion(OldPop,pInversion)
global m n NewPop
NewPop=OldPop;
r=rand(1,m);
PopIn=find(r<=pInversion);
len=length(PopIn);
i=1;
if len>=1
while(i<=len)
d=sort(unidrnd(n,1,2));