最后还将改进的算法进行适当推广，给出了求解多旅行商问题(mtsp)的具体步骤。
Finally, we develop our algorithm to solve MTSP and give the concrete method.
研究了钢铁厂的热轧调度问题，将其转化为带有能力约束的多旅行商问题，并对此给出一个启发式算法。
This paper deals with the problem of hot rolling scheduling in iron and steel pl ants, and it is treated as a multiple traveling salesmen problem with capacity constraints and a heuristic is proposed.
将皮革裁剪多轮廓加工空行程路径优化问题归结为广义旅行商问题，提出了一种求解问题的混合智能优化算法。
Tool-path airtime optimization during multi-contour processing in leather cutting is regarded as generalized traveling salesman problem. A hybrid intelligence algorithm was proposed.
将皮革裁剪多轮廓加工空行程路径优化问题归结为广义旅行商问题，提出了一种求解问题的混合智能优化算法。
Tool-path airtime optimization during multi-contour processing in leather cutting is regarded as generalized traveling salesman problem. A hybrid intelligence algorithm was proposed.
应用推荐