Abstract
We study the Multi-Depot Multiple Traveling Salesman Problem (MDMTSP), which is a variant of the very well-known Traveling Salesman Problem (TSP). In the MDMTSP an unlimited number of salesmen have to visit a set of customers using routes that can be based on a subset of available depots. The MDMTSP is an NP-hard problem because it includes the TSP as a particular case when the distances satisfy the triangular inequality. The problem has some real applications and is closely related to other important multi-depot routing problems, like the Multi-Depot Vehicle Routing Problem and the Location Routing Problem. We present an integer linear formulation for the MDMTSP and strengthen it with the introduction of several families of valid inequalities. Certain facet-inducing inequalities for the TSP polyhedron can be used to derive facet-inducing inequalities for the MDMTSP. Furthermore, several inequalities that are specific to the MDMTSP are also studied and proved to be facet-inducing. The partial knowledge of the polyhedron has been used to implement a Branch-and-Cut algorithm in which the new inequalities have been shown to be very effective. Computational results show that instances involving up to 255 customers and 25 possible depots can be solved optimally using the proposed methodology.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Applegate, D., Bixby, R. E., Chvátal, V., & Cook, W. (2006). The traveling salesman problem: a computational study. New Jersey: Princeton University Press.
Baldacci, R., & Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming Series A, 120(2), 347–380.
Bektas, T. (2006). The multiple traveling salesman problem: an overview of formulations and solution procedures. The International Journal of Management Science, 34, 1449–1458.
Belenguer, J. M., Benavent, E., Prins, C., Prodhon, C., & Wolfler-Calvo, R. (2011). A branch and cut method for the capacitated location-routing problem. Computers & Operations Research, 8(6), 931–941.
Benavent, E., & Martínez, A. (2011). A polyhedral study of the multi-depot multiple TSP. Internal report, Universitát de Valencia. http://www.uv.es/~benavent/MDMTSP/report_MDMTSP.pdf.
Chvátal, V. (1973). Edmonds polytopes and weakly hamiltonian graphs. Mathematical Programming, 5, 29–40.
Cordeau, J. F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105–119.
Grötschel, M., & Holland, O. (1987). A cutting-plane algorithm for minimum perfect 2-matchings. Computing, 39, 327–344.
Grötschel, M., & Padberg, M. W. (1979). On the symmetric traveling salesman problem I: inequalities. Mathematical Programming Studies, 16, 265–280.
GuoXing, Y. (1995). Transformation of multi-depot multi-salesmen problem to the travelling salesman problem. European Journal of Operational Research, 81, 557–560.
Gutin, G., & Punnen, A. P. (2002). The traveling salesman problem and its variations. Dordrecht: Kluwer Academic.
Kara, I., & Bektas, T. (2006). Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research, 174, 1449–1458.
Labbé, M., Martín, I. R., & Salazar, J. J. (2004). A branch-and-cut algorithm for the plant-cycle location problem. The Journal of the Operational Research Society, 55, 513–520.
Laporte, G., Nobert, Y., & Taillefer, S. (1988). Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science, 22(3), 161–172.
Laporte, G., Nobert, Y., & Arpin, D. (1986). An exact algorithm for solving a capacitated location-routing problem. Annals of Operations Research, 6, 283–310.
Laporte, G., Nobert, Y., & Arpin, D. (1984). Optimal solutions to capacitated multi-depot vehicle routing problems. Congressus Numerantium, 44, 283–292.
Malik, W., Rathinam, S., & Darbha, S. (2007). An approximation algorithms for a symmetric generalized multiple depot, multiple travelling salesman problem. Operations Research Letters, 35, 747–753.
Naddef, D., & Rinaldi, G. (1993). The graphical relaxation: a new framework for the symmetric traveling salesman polytope. Mathematical Programming Series A, 58, 53–88.
Padberg, M. W., & Rinaldi, G. (1990). Facet identification for the symmetric traveling salesman polytope. Mathematical Programming Series A, 47, 219–257.
Parragh, S. N. (2010). Solving a real-world service technician routing and scheduling problem. Presented at seventh Triennial symposium on transportation analysis. TRISTAN VII, Tromso, Norway, June 20–25.
Queyranne, M., & Wang, Y. (1993). Hamiltonian path and symmetric travelling salesman polytopes. Mathematical Programming Series A, 58, 89–110.
Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Calvo, R. W. (2007). Solving the Capacitated LRP by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 41(4), 470–483.
Rathinam, S., Sengupta, R., & Darbha, S. (2007). A resource allocation algorithm for multiple vehicle systems with non-holonomic constraints. IEEE Transactions on Automation Science and Engineering, 4(1), 98–104.
Reinelt, G. (1991). TSPLIB: a travelling salesman problem library. ORSA Journal on Computing, 3, 376–384.
Yadlapalli, S., Malik, W. A., Darbha, S., & Pachter, M. (2009). A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem. Nonlinear Analysis: Real World Applications, 10, 1990–1999.
Yadlapalli, S., Malik, W. A., Rathinam, S., & Darbha, S. (2007). A Lagrangian-based algorithm for a combinatorial motion planning problem. In Proceedings of the 46th conference on decision and control, New Orleans, Dec. 12–14.
Acknowledgements
The contributions by Enrique Benavent and Antonio Martínez have been partially supported by the Ministerio de Ciencia e Innovación of Spain through projects MTM2009-14039-C06-02 and DPI2008-02700, respectively and co financed by FEDER funds.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Benavent, E., Martínez, A. Multi-depot Multiple TSP: a polyhedral study and computational results. Ann Oper Res 207, 7–25 (2013). https://doi.org/10.1007/s10479-011-1024-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-1024-y