mutation.m

遗传算法求解TSP问题,采用轮盘赌选择方法,部分匹配交叉算子,交换变异设计.

%基本交换变异算子
function farm2=mutation(farm1,n,q,N)
mq=n*q;
farm2=farm1;
for i=1:mq
    ui=ceil(rand*n);
    U(i,:)=farm1(ui,:);
    for qe=1:4
        aa(qe)=ceil(rand*N);
        bb(qe)=ceil(rand*N);
       middle(1,1)=U(i,aa(qe));
       U(i,aa(qe))=U(i,bb(qe));
       U(i,bb(qe))=middle(1,1);
    end
    farm2(ui,:)=U(i,:);
end