The multiple traveling salesman problem: an overview of formulations and solution procedures

The multiple traveling salesman problem: an overview of formulations and solution procedures

0.00 Avg rating0 Votes
Article ID: iaor2008499
Country: United Kingdom
Volume: 34
Issue: 3
Start Page Number: 209
End Page Number: 219
Publication Date: Jun 2006
Journal: OMEGA
Authors:
Keywords: practice
Abstract:

The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling salesman problem (TSP), where more than one salesman is allowed to be used in the solution. Moreover, the characteristics of the mTSP seem more appropriate for real-life applications, and it is also possible to extend the problem to a wide variety of vehicle routing problems (VRPs) by incorporating some additional side constraints. Although there exists a wide body of the literature for the TSP and the VRP, the mTSP has not received the same amount of attention. The purpose of this survey is to review the problem and its practical applications, to highlight some formulations and to describe exact and heuristic solution procedures proposed for this problem.

Reviews

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