choose.m

来自「采用遗传算法对于加工问题的排序,使其最快.」· M 代码 · 共 21 行

function seq_copy=choose(C,pop_size,seq_init)
C_freq=C./sum(C);
for i=1:size(C,1)
    if  i==1
        C_sum_freq(i)=C_freq(i);
    else
        C_sum_freq(i)=C_sum_freq(i-1)+C_freq(i);
    end
end
C_sum_freq=C_sum_freq';
chose_P=rand(pop_size,1);
for i=1:pop_size
    if chose_P(i)<=C_sum_freq(1)
            seq_copy(i,:)=seq_init(1,:);
    end
    for j=1:pop_size-1
        if chose_P(i)>C_sum_freq(j) && chose_P(i)<=C_sum_freq(j+1)
            seq_copy(i,:)=seq_init(j+1,:);
        end
    end
end