savebest.m

来自「改进GA解决TSP问题」· M 代码 · 共 14 行

%选择方法
%精英保留策略
function farm2=savebest(selectionsave,farm1,n,D)
farm2=farm1;
for cr=1:n
    disbest(cr,1)=myLength(D,selectionsave(cr,:));
    disworst(cr,1)=myLength(D,farm1(cr,:));
end
    dismin=min(disbest);
    crr=find(disbest==dismin);
    dismax=max(disworst);
    crc=find(disworst==dismax);
    farm2(crc(1,1),:)=selectionsave(crr(1,1),:);