模拟退火法求解旅行商问题（TSP）

 话不多说，直接上数据和代码。

原始数据：

x坐标	y坐标
153	83
281	626
440	661
527	730
457	891
876	983
958	580
240	16
676	120
289	863
672	484
695	845
68	209
255	552
424	635
607	208
191	565
684	574
547	52
426	932
709	859
236	786
119	513
541	854
870	348
265	446
318	54
119	177
940	663
646	331
479	899
639	118
545	989
647	540
331	298
424	46
270	505
197	762
822	631
430	89
888	80
391	778
769	906
397	534
809	109
885	557
318	128
534	550
90	485
111	891

代码如下：

注意：运行一次后可把初始路径改为上一次的结果，多次运行即可得到较好的结果。 

data = xlsread('data.xlsx');
x = data(:, 1);
y = data(:, 2);

% 添加医药公司的位置坐标
x = [0; x];
y = [0; y];

% 计算点之间的距离矩阵
n = length(x);
dist_matrix = zeros(n, n);
for i = 1:n
    for j = 1:n
        dist_matrix(i, j) = sqrt((x(i) - x(j))^2 + (y(i) - y(j))^2);
    end
end


% 模拟退火算法参数设置
max_iterations = 5000;
initial_temperature = 100;
cooling_rate = 0.99;

% 初始化路径
current_path = 1:n;
best_path = current_path;
best_distance = calculate_distance(current_path, dist_matrix);

% 运行模拟退火算法
temperature = initial_temperature;
iteration = 0;
while temperature > 1 && iteration < max_iterations
    % 生成新路径
    new_path = generate_new_path(current_path);

    % 计算新路径的距离
    new_distance = calculate_distance(new_path, dist_matrix);

    % 判断是否接受新路径
    if accept_new_distance(best_distance, new_distance, temperature)
        current_path = new_path;
        best_distance = new_distance;
        if new_distance < calculate_distance(best_path, dist_matrix)
            best_path = new_path;
        end
    end

    % 降低温度
    temperature = temperature * cooling_rate;
    iteration = iteration + 1;
end

% 计算路径的总距离
total_distance = calculate_distance(best_path, dist_matrix);

% 输出结果
disp("最短送药线路为：");
disp(best_path);
disp("总距离为：" + total_distance);

% 画出线路图
figure;
plot(x, y, 'ro');
hold on;
plot(x(best_path), y(best_path), 'b-');
plot([0 x(best_path(1))], [0 y(best_path(1))], 'b-');
plot([0 x(best_path(end))], [0 y(best_path(end))], 'b-');
xlabel('x坐标');
ylabel('y坐标');
title('最短运输线路图');
legend('用户', '管道线路');

% 计算路径的总距离

function distance = calculate_distance(path, dist_matrix)
distance = 0;
num_points = length(path);
for i = 1:num_points-1
    distance = distance + dist_matrix(path(i), path(i+1));
end
distance = distance + dist_matrix(path(end), 1);  % 添加回医药公司的距离
end

% 生成新路径
function new_path = generate_new_path(path)
new_path = path;
num_points = length(path);
start_index = randi([2, num_points-1]);  % 保持医药公司在起始位置，不改变
end_index = randi([start_index+1, num_points]);
new_path(start_index:end_index) = flip(path(start_index:end_index));
end

% 判断是否接受新路径
function accept = accept_new_distance(current_distance, new_distance, temperature)
if new_distance < current_distance
    accept = true;
else
    probability = exp((current_distance - new_distance) / temperature);
    accept = rand() < probability;
end
end

运行结果如下：