遗传算法最短距离matlab程序

以下是一个遗传算法求解TSP问题的MATLAB程序示例：

% TSP问题的遗传算法求解
% 假设有N个城市，距离矩阵为dist
% popsize为种群大小，maxgen为最大迭代次数

N = 10; % 城市数量
dist = rand(N,N); % 距离矩阵
popsize = 50; % 种群大小
maxgen = 100; % 最大迭代次数

% 初始化种群
pop = zeros(popsize,N);
for i = 1:popsize
    pop(i,:) = randperm(N);
end

% 迭代
for gen = 1:maxgen
    % 计算适应度
    fitness = zeros(popsize,1);
    for i = 1:popsize
        fitness(i) = 1/sum(dist(pop(i,:),[1:N,1]));
    end
    
    % 选择
    [fitness,idx] = sort(fitness,'descend');
    pop = pop(idx,:);
    pop = pop(1:popsize,:);
    
    % 交叉
    for i = 1:2:popsize
        p1 = pop(i,:);
        p2 = pop(i+1,:);
        child = zeros(1,N);
        idx = randperm(N,2);
        idx = sort(idx);
        child(idx(1):idx(2)) = p1(idx(1):idx(2));
        j = 1;
        for k = 1:N
            if ~ismember(p2(k),child)
                while child(j) ~= 0
                    j = j + 1;
                end
                child(j) = p2(k);
            end
        end
        pop(i,:) = child;
    end
    
    % 变异
    for i = 1:popsize
        if rand < 0.01
            idx = randperm(N,2);
            pop(i,[idx(1),idx(2)]) = pop(i,[idx(2),idx(1)]);
        end
    end
    
    % 输出结果
    fprintf('第%d代，最优解：%f\n',gen,1/fitness(1));
end

% 输出最优解
fprintf('最优解：%f\n',1/fitness(1));