複数巡回セールスマン問題の包括的サーベイ:応用・手法・分類体系
A Comprehensive Survey on the Multiple Travelling Salesman Problem: Applications, Approaches and Taxonomy
複数巡回セールスマン問題(MTSP)の近年の研究を、古典的な車両・ロボットから無人航空機まで対象に、解法と応用分野を整理し、変種の分類体系を提案したサーベイ論文。
著者: Omar Cheikhrouhou, Ines Khoufi
分類: cs.CC, cs.RO
原文アブストラクト
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.
