mutation.m

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

function seq_mutation=mutation(pm,seq_crossover,job_total,pop_size)
for i=1:pop_size
    if rand(1)<=pm
        seq_mutation(i,:)=randperm(job_total);
    else
        seq_mutation(i,:)=seq_crossover(i,:);
    end
end