mutation.m

来自「遗传优化算法」· M 代码 · 共 15 行

function child=mutation(father,p)
[n,m]=size(father);
for i=1:n
    if rand<p
        j=round(rand*(m-1))+1;
        if father(i,j)==0
           father(i,j)=1;
        elseif father(i,j)==1
           father(i,j)=0;
        end
    else continue;
    end  
end
child=father;