mutation1.m

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

function [mutation_a,mutation_b]=mutation1(pm,crossover_a,crossover_b,job_total,pop_size)
mutation_a=crossover_a;
mutation_b=crossover_b;
for i=1:pop_size
    for j=1:job_total*(ceil(log2(job_total))+1)
        if rand<=pm
        mutation_b(i,j)=crossover_a(i,j);
        mutation_a(i,j)=crossover_b(i,j);
        end
    end
end