tsp贪心算法matlab

以下是使用贪心算法求解TSP问题的MATLAB代码：

function [path, dist] = tsp_greedy(coord)
% coord: n-by-2 matrix of coordinates
% path: 1-by-n vector of node indices
% dist: total distance of the path

n = size(coord, 1);
path = zeros(1, n);
used = zeros(1, n);
path(1) = 1;
used(1) = 1;

for i = 2:n
    min_dist = inf;
    min_idx = -1;
    for j = 1:n
        if ~used(j)
            d = norm(coord(path(i-1), :) - coord(j, :));
            if d < min_dist
                min_dist = d;
                min_idx = j;
            end
        end
    end
    path(i) = min_idx;
    used(min_idx) = 1;
end

dist = 0;
for i = 1:n-1
    dist = dist + norm(coord(path(i), :) - coord(path(i+1), :));
end
dist = dist + norm(coord(path(n), :) - coord(path(1), :));

end

该算法的思想是从起点开始，每次选择离当前节点最近的未访问节点作为下一个节点，直到所有节点都被访问过。然而，这种贪心策略并不一定能得到最优解，因为它只考虑了当前的最优解，而没有考虑全局最优解。