multimutation.m

来自「改进GA解决TSP问题」· M 代码 · 共 54 行

%混合变异算子
function farm3=multimutation(farm2,n,q,N)
mq=n*q;
farm3=farm2;

%交换变异
for i=1:mq
    ui=ceil(rand*n);
    U(i,:)=farm2(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
    farm3(ui,:)=U(i,:);
end

%倒位变异
for i=1:mq
    vi=ceil(rand*n);
    V(i,:)=farm2(vi,:);
    n1=ceil(rand*N);
    n2=ceil(rand*N);
    qm=1;
    for j=n1:n2
        cm(1,qm)=V(i,j);
        qm=qm+1;
    end
    qm=qm-1;
    for j=n1:n2
        V(i,j)=cm(1,qm);
        qm=qm-1;
    end  
  farm3(vi,:)=V(i,:);
end

%邻位变异
for i=1:mq
    zi=ceil(rand*n);
    Z(i,:)=farm2(zi,:);
    z1=ceil(rand*N);
    if z1~=N
    mid1(1,1)=Z(i,z1+1);
    Z(i,z1+1)=Z(i,z1);
    Z(i,z1)=mid1(1,1);
    else
    mid1(1,1)=Z(i,1);
    Z(i,1)=Z(i,z1);
    Z(i,z1)=mid1(1,1);
    end
        farm3(zi,:)=Z(i,:);
end