贪心算法解决tsp问题的matlab代码

以下是贪心算法解决tsp问题的Matlab代码示例：

function [best_path, best_distance] = tsp_greedy(city_locations)
% TSP_GREEDY 使用贪心算法解决TSP问题
%   city_locations - 城市位置向量，每行一个城市的 (x, y) 坐标
%   best_path - 最短路径的城市编号序列
%   best_distance - 最短路径的长度

num_cities = size(city_locations, 1);
best_path = zeros(1, num_cities);
best_distance = inf;
visited = zeros(1, num_cities);

% 从每个城市出发，找到最短的路径
for start_city = 1:num_cities
    path = zeros(1, num_cities);
    path(1) = start_city;
    visited(start_city) = 1;
    distance = 0;
    
    % 选择最近的未访问城市，并标记为已访问
    for i = 2:num_cities
        min_distance = inf;
        for j = 1:num_cities
            if ~visited(j)
                d = norm(city_locations(path(i-1), :) - city_locations(j, :));
                if d < min_distance
                    min_distance = d;
                    path(i) = j;
                end
            end
        end
        visited(path(i)) = 1;
        distance = distance + min_distance;
    end
    
    % 回到起点
    d = norm(city_locations(path(num_cities), :) - city_locations(start_city, :));
    distance = distance + d;
    
    % 更新最优解
    if distance < best_distance
        best_path = path;
        best_distance = distance;
    end
    
    % 重置已访问标记
    visited = zeros(1, num_cities);
end

end

使用示例：

% 生成随机的城市位置
num_cities = 10;
city_locations = rand(num_cities, 2);

% 使用贪心算法求解TSP问题
[best_path, best_distance] = tsp_greedy(city_locations);

% 显示结果
fprintf('最短路径长度为 %.2f:\n', best_distance);
disp(best_path);