mutation_2.txt

PSO-ACO-TSP算法

%mutation_2.m
%变异策略2
function cnew=mutation_2(c0,n)
j1=ceil(n*rand);
cnew=c0;
if j1<n
      cnew(j1)=c0(j1+1);
      cnew(j1+1)=c0(j1);
else
      cnew(j1)=c0(1);
      cnew(1)=c0(j1);
end