mutation.m

来自「一个遗传算法实现TSP问题的基本演示程序」· M 代码 · 共 19 行

function popnew=mutation(pop,pmut,popsize,ncity)

%变异函数
%pmut为变异概率
k=1;
while k<=popsize
     rk=rand();
    if rk<pmut   
        pos1=fix(rand()*ncity)+1; %随机产生变异点
        pos2=fix(rand()*ncity)+1;
        t=pop(k,pos1);
        pop(k,pos1)=pop(k,pos2); %对变异点进行变异
        pop(k,pos2)=t;
     end
     k=k+1;
end
popnew=pop;
clear t;
clear pose;