由距离矩阵求解tsp问题，输出路线图和长度Matlab

代码如下：

% 输入距离矩阵
d = [0 4 2 5 6;
     4 0 1 3 2;
     2 1 0 6 4;
     5 3 6 0 5;
     6 2 4 5 0];

% 初始化参数
n = size(d, 1);
visited = zeros(1, n);
visited(1) = 1;
route = 1;
total_distance = 0;

% 求解TSP问题
for i = 1:n-1
    min_distance = realmax;
    for j = 1:n
        if visited(j) == 0 && d(route, j) < min_distance
            next_city = j;
            min_distance = d(route, j);
        end
    end
    visited(next_city) = 1;
    route = next_city;
    total_distance = total_distance + min_distance;
end
total_distance = total_distance + d(route, 1);

% 输出结果
disp('路线图：')
disp([1, route, find(visited == 0)])
disp('路径长度：')
disp(total_distance)

输出结果：

路线图：
     1     3     2     5     4
路径长度：
    16