The Multiple Travelling Salesman Problem (MTSP) is among the most interestingcombinatorial optimization problems . It is widely adopted in real-life applications, including robotics, transportation, networking, etc. We analyze the MTSP variants and propose ataxonomy and a classification of recent studies . We focus on MTSP’s recent contributions to both classical vehicles/robots andunmanned aerial vehicles. We highlight the approaches applied to solve the problem as well as its application domains. We propose a classification and classification of the recent studies.

Author(s) : Omar Cheikhrouhou, Ines Khoufi

Links : PDF - Abstract

Code :


Keywords : classification - problem - mtsp - travelling - salesman -

Leave a Reply

Your email address will not be published. Required fields are marked *