selection.m

来自「基于遗产算法的FCM算法」· M 代码 · 共 16 行

function New_G=selection(G,F,G_Num)
for i=1:G_Num
    r=rand*sum(F);
    add_temp=0;
    j=1;
    while (add_temp<r)&(j<(size(G,1))+1)
        add_temp=add_temp+F(j);
        j=j+1;
    end
    if j==1
        j=1;
    else j=j-1;
    end
    New_G(i,:)=G(j,:);
end