中文摘要：

多旅行的售货员问题(MTSP ) 是旅行售货员问题的延期，它是一个著名 NP 难问题，并且能被用来解决许多真实世界问题，例如放的铁路交通，路由和管道。在这份报纸，我们分析 MTSP 的一般性质，并且发现在图的多重仓库和关上的路径是为 MTSP 的一个大问题。因此，一个新奇方法被介绍解决它。我们第一把一张复杂的图转变成简化的，然后，一个有效算法被建议基于简化结果解决 MTSP。另外，我们也建议一个方法由使用 2-OPT 优化一般结果。模拟结果证明我们的方法能高效地为 MTSP 发现全球答案。

英文摘要：

Multi-traveling salesman problem （MTSP） is an extension of traveling salesman problem, which is a famous NP hard problem, and can be used to solve many real world problems, such as railway transportation, routing and pipeline laying. In this paper, we analyze the general properties of MTSP, and find that the multiple depots and closed paths in the graph is a big issue for MTSP. Thus, a novel method is presented to solve it. We transform a complicated graph into a simplified one firstly, then an effective algorithm is proposed to solve the MTSP based on the simplified results. In addition, we also propose a method to optimize the general results by using 2-OPT. Simulation results show that our method can find the global solution for MTSP efficiently.