An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem

In this paper, we present an algorithm with an approximation factor of 2 for a Generalized, Multiple Depot, Multiple Travelling Salesman Problem (GMTSP) when the costs are symmetric and satisfy the triangle inequality. The algorithm requires finding a degree constrained minimum spanning tree which we compute using a Lagrangian relaxation.

[1]  Michel X. Goemans,et al.  Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[2]  J.K. Hedrick,et al.  The software architecture of the Berkeley UAV Platform , 2006, 2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control.

[3]  N. Megiddo,et al.  Maximizing Concave Functions in Fixed Dimension , 1993 .

[4]  Max Donath,et al.  American Control Conference , 1993 .

[5]  Satish Rao,et al.  What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs , 2005, APPROX-RANDOM.

[6]  R. Ravi,et al.  Primal-dual meets local search: approximating MST's with nonuniform degree bounds , 2003, STOC '03.

[7]  Mohit Singh,et al.  Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs , 2006, ICALP.

[8]  Satish Rao,et al.  A Push-Relabel Algorithm for Approximating Degree Bounded MSTs , 2006, ICALP.

[9]  Balaji Raghavachari,et al.  Degree-bounded minimum spanning trees , 2004, CCCG.

[10]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[11]  F. Bullo,et al.  On the point-to-point and traveling salesperson problems for Dubins' vehicle , 2005, Proceedings of the 2005, American Control Conference, 2005..

[12]  Manfred W. Padberg,et al.  Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges , 1977, Oper. Res..

[13]  Yang GuoXing,et al.  Transformation of multidepot multisalesmen problem to the standard travelling salesman problem , 1995 .

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

[15]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[16]  R. Ravi,et al.  The Constrained Minimum Spanning Tree Problem (Extended Abstract) , 1996, SWAT.

[17]  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).

[18]  R. Ravi,et al.  Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds , 2005, SIAM J. Comput..

[19]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[20]  Bernard Chazelle.  A faster deterministic algorithm for minimum spanning trees , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[21]  M. R. Rao,et al.  Technical Note - A Note on the Multiple Traveling Salesmen Problem , 1980, Oper. Res..