repruduction.m

来自「人工免疫进化算法来解决简单字符串识别的问题」· M 代码 · 共 22 行

function a=repruduction(fit)
global concentration;
global pop;
[px,py]=size(pop);

[maxvalue,maxposition]=max(fit);
%[minvalue,minposition]=min(fit);
for i=1:px
    if(concentration(i)<1/(2*px))
        pop(i,:)=pop(maxposition,:);
    end
end
%disp(pop);
%pop(minposition:)=pop(maxposition:);%The first time,the best one subtitute the worst one;
%mutation(minposition:);
%copy
%fit(maxposition)=(maxvalue+mivalue)/2;
%fit(minposition)=(maxvalue+mivalue)/2;
%clear
%{maxvalue,maxposition]=max(fit);
%minvalue,minposition]=min(fit);%find the sencond better one and the second worse one;