mutation.m

来自「遗传算法中二十个非常经典的原代码」· M 代码 · 共 14 行

function P = mutation(P,Nb,Pm)
%变异
Nbb = length(Nb);
for n = 1:size(P,1)
    b2 = 0;
    for m = 1:Nbb
        if rand < Pm
            b1 = b2 + 1;
            bi = b1 + mod(floor(rand*Nb(m)),Nb(m)); 
            b2 = b2 + Nb(m);
            P(n,bi) = ~P(n,bi);
        end
    end
end