A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots

We study a natural extension of the classical traveling salesman problem (TSP) in the situation where multiple salesmen are dispatched from a number of different depots. As with the TSP, this problem is motivated by a large range of applications in vehicle routing. Although it is known to have a 2-approximation algorithm, whether the problem has a 3/2-approximation algorithm, as is the case with the well-known Christofides heuristic for the TSP, remains an open question. We answer this question positively by providing a 3/2-approximation algorithm for the problem with a fixed number of depots. The algorithm uses an edge exchange strategy, and its analysis hinges on a newly discovered exchange property of matroids. In addition, the algorithm is applied to multidepot extensions of other TSP variants, and we show for the first time, to our knowledge, that for these multidepot extensions the same best constant approximation ratios can be achieved as for their respective single-depot cases.

[1]  Raja Sengupta,et al.  A Resource Allocation Algorithm for Multivehicle Systems With Nonholonomic Constraints , 2007, IEEE Transactions on Automation Science and Engineering.

[2]  Greg N. Frederickson,et al.  Approximation Algorithms for Some Postman Problems , 1979, JACM.

[3]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[4]  Swaroop Darbha,et al.  A Lagrangian-Based Algorithm for a Multiple Depot, Multiple Travelling Salesmen Problem , 2007, ACC.

[5]  Liang Xu,et al.  An analysis of the extended Christofides heuristic for the k-depot TSP , 2011, Oper. Res. Lett..

[6]  M. Pachter,et al.  Research issues in autonomous control of tactical UAVs , 1998, Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207).

[7]  M. Pachter,et al.  Complexity in UAV cooperative control , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[8]  Esther M. Arkin,et al.  Approximations for minimum and min-max vehicle routing problems , 2006, J. Algorithms.

[9]  Samir Khuller,et al.  Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem , 1998, FSTTCS.

[10]  Jean-Yves Potvin,et al.  State-of-the Art Review - Evolutionary Algorithms for Vehicle Routing , 2009, INFORMS J. Comput..

[11]  John M. Wilson,et al.  A variation of the generalized assignment problem arising in the New Zealand dairy industry , 1997, Ann. Oper. Res..

[12]  Stefan Irnich,et al.  A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics , 2008, INFORMS J. Comput..

[13]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[14]  J. Vygen.  Jens Vygen New approximation algorithms for the TSP , 2012 .

[15]  Raja Sengupta,et al.  3/2-approximation algorithm for two variants of a 2-depot Hamiltonian path problem , 2010, Oper. Res. Lett..

[16]  A. J.,et al.  Analysis of Christofides ' heuristic : Some paths are more difficult than cycles , 2002 .

[17]  I D Giosa,et al.  New assignment algorithms for the multi-depot vehicle routing problem , 2002, J. Oper. Res. Soc..

[18]  Swaroop Darbha,et al.  An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem , 2007, Oper. Res. Lett..

[19]  W. A. Malik,et al.  A Lagrangian-Based Algorithm for a Multiple Depot, Multiple Travelling Salesmen Problem , 2007, 2007 American Control Conference.

[20]  Vangelis Th. Paschos,et al.  Approximation algorithms for the traveling salesman problem , 2003, Math. Methods Oper. Res..

[21]  Sivakumar Rathinam,et al.  Approximation algorithms for multiple terminal, Hamiltonian path problems , 2012, Optim. Lett..