mathematica写一个，商旅问题求解程序

以下是一个简单的商旅问题求解程序：

(* 定义城市数量 *)
n = 5;

(* 定义城市之间的距离矩阵 *)
distanceMatrix =
Table[If[i == j, 0, RandomInteger[{1, 10}]], {i, 1, n}, {j, 1, n}];

(* 打印距离矩阵 *)
MatrixForm[distanceMatrix]

(* 定义初始路径 *)
initialPath = Range[n];

(* 定义路径长度函数 *)
pathLength[path_] :=
Total@Table[distanceMatrix[[path[[i]], path[[i + 1]]]], {i, 1, n - 1}] +
distanceMatrix[[path[[n]], path[[1]]]];

(* 定义随机交换两个城市的函数 *)
swapCities[path_] :=
Module[{i, j, newPath}, {i, j} = RandomInteger[{1, n}, 2];
newPath = path;
newPath[[{i, j}]] = newPath[[{j, i}]];
newPath]

(* 定义模拟退火算法求解商旅问题 *)
simulatedAnnealing[path_, temperature_, coolingRate_,
stoppingTemperature_] :=
Module[{currentPath, bestPath, currentLength, bestLength, delta,
probability, newTemperature}, currentPath = path;
bestPath = path;
currentLength = pathLength[path];
bestLength = currentLength;
While[temperature > stoppingTemperature,
newTemperature = temperature*coolingRate;
newpath = swapCities[currentPath];
delta = pathLength[newpath] - currentLength;
If[delta < 0, currentPath = newpath;
currentLength = pathLength[newpath],
probability = Exp[-delta/temperature];
If[RandomReal[] < probability, currentPath = newpath;
currentLength = pathLength[newpath]]];
If[currentLength < bestLength, bestPath = currentPath;
bestLength = currentLength];
temperature = newTemperature];
bestPath]

(* 运行模拟退火算法 *)
bestPath = simulatedAnnealing[initialPath, 100, 0.99, 0.1];

(* 打印最优路径和路径长度 *)
bestPath
pathLength[bestPath]