The Multiple Travelling Salesman Problem (MTSP) is among the most interesting combinatorial optimization problems because it is widely adopted in real-life applications, including robotics, transportation, networking, etc. Although the importance of this optimization problem, there is no survey dedicated to reviewing recent MTSP contributions. In this paper, we aim to fill this gap by providing a comprehensive review of existing studies on MTSP. In this survey, we focus on MTSP's recent contributions to both classical vehicles/robots and unmanned aerial vehicles. We highlight the approaches applied to solve the MTSP as well as its application domains. We analyze the MTSP variants and propose a taxonomy and a classification of recent studies.

中文翻译：

---

多重旅行商问题的综合调查：应用，方法和分类

多重旅行推销员问题（MTSP）是最有趣的组合优化问题之一，因为它已在包括机器人，运输，网络等在内的现实应用中广泛采用。尽管此优化问题的重要性，但尚无专门针对此问题的调查。审查MTSP最近的贡献。在本文中，我们旨在通过对现有关于MTSP的研究进行全面回顾来填补这一空白。在本次调查中，我们重点介绍了MTSP对传统车辆/机器人和无人机的最新贡献。我们重点介绍了用于解决MTSP及其应用领域的方法。我们分析了MTSP变体，并提出了分类学和最近研究的分类。