tsp_cross.m

用遗传算法求解TSP（旅行商）问题

function [a_new,b_new] = TSP_cross(a,b,p1,p2)

n = size(a,2);

a_new = zeros(1,n);
b_new = zeros(1,n);

if (p1==1&&p2==n)
    b_new = a;
    a_new = b;
    return;
end

pa = zeros(1,n);
pb = zeros(1,n);

for i=1:n
    pa(a(i)) = i;
    pb(b(i)) = i;
end 

aa = zeros(1,n);
aa(p1:p2) = a(p1:p2);
bb = b;
for i=p1:p2
    bb(pb(a(i))) = 0;
end

j = p2+1;
if (j > n)
    j = j - n;
end
for i=[p2+1:n 1:p1-1]
    while(bb(j)==0)
        j = j+1;
        if (j > n)
            j = j-n;
        end
    end
    aa(i) = bb(j);
    j = j + 1;
    if (j > n)
        j = j-n;
    end
end

a_new = aa;

bb = zeros(1,n);
bb(p1:p2) = b(p1:p2);
aa = a;
for i=p1:p2
    aa(pa(b(i))) = 0;
end

j = p2+1;
if (j > n)
    j = j - n;
end
for i=[p2+1:n 1:p1-1]
    while(aa(j)==0)
        j = j+1;
        if (j > n)
            j = j-n;
        end
    end
    bb(i) = aa(j);
    j = j + 1;
    if (j > n)
        j = j-n;
    end
end

b_new = bb;