Exact Solution of Multiple Traveling Salesman Problem

This paper presents a method developed for the multiple traveling salesman problem (m-TSP), which is a generalization of the well known TSP [6]. In the m-TSP, there are m salesmen who are required to visit n customers in such a way that all customers are visited exactly once by exactly one of the salesmen. Hence, each salesman leaves from and returns to the same point, the depot, and each one of them completes a tour visiting a subset of the customers.