mutation_3.txt

来自「PSO-ACO-TSP算法」· 文本 代码 · 共 14 行

%mutation_3.m
%变异策略3
function cnew=mutation_3(c0,n)
j1=ceil(n*rand);
j2=ceil(n*rand);
j3=min(j1,j2);
j4=max(j1,j2);
cnew=c0;
k=1;
while k<=j4-j3+1
    cnew(j3+k-1)=c0(j4-k+1);
    k=k+1;
end