最后还将改进的算法进行适当推广，给出了求解多旅行商问题(mtsp)的具体步骤。
Finally, we develop our algorithm to solve MTSP and give the concrete method.
为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。
To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.
研究了钢铁厂的热轧调度问题，将其转化为带有能力约束的多旅行商问题，并对此给出一个启发式算法。
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.
应用推荐