A Lagrangian-Based Algorithm for a Multiple Depot, Multiple Travelling Salesmen Problem

In this manuscript, we consider the problem of motion planning of m Dubins' vehicles through n points in a plane. The initial location and heading of the vehicles is specified and is assumed to be distinct for each vehicle. A motion plan for a vehicle is given by the sequence of points and the corresponding angles at which each point must be visited by the vehicle. We require that each vehicle return to the same initial location (depot) at the same heading after visiting the points. The objective of the motion planning problem is to choose at most q(les m) Dubins' vehicles and find their motion plans so that all the points are visited and the total cost of the tours of the chosen vehicles is a minimum amongst all the possible choice of vehicles and their tours. This problem is a generalization of the multiple depot, multiple travelling salesmen problem (MDMTSP) in two directions - the problem involves the determination of choice of vehicles and their respective headings at each of their assigned points. This problem is NP-hard. We propose a two step approach to solving this problem - (1) the combinatorial problem of choosing the vehicles and their associated tours is based on Euclidean distances between points and (2) once the sequence of points to be visited, the heading at each point is determined based on a dynamic programming scheme. The solution to the first step is based on a generalization of Held-Karp's method for the MDMTSP. We modify the Lagrangian heuristics, in the literature, for finding a close primal solution from the Held-Karp's (dual) solution. Empirical results seem to indicate that this scheme seems to provide primal solutions which are within 5% of the optimum in the span of 25 dual iterations for instances which have about 45 cities to visit and 6 vehicles.

[1]  David S. Johnson,et al.  Experimental Analysis of Heuristics for the STSP , 2007 .

[2]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[3]  L. Dubins On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[4]  Swaroop Darbha,et al.  A Resource Allocation Algorithm for Multi-Vehicle Systems with Non holnomic Constraints , 2005 .

[5]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[6]  R. Sengupta,et al.  Lower and Upper Bounds for a Symmetric Multiple Depot, Multiple Travelling Salesman Problem , 2006 .

[7]  L. Wolsey Heuristic analysis, linear programming and branch and bound , 1980 .

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

[9]  S. Darbha,et al.  Combinatorial Motion Planning of Multiple Vehicle Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

[11]  David P. Williamson ANALYSIS OF THE HELD-KARP HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM , 1990 .

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

[13]  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..

[14]  Paul M. Griffin,et al.  Path planning for a mobile robot , 1992, IEEE Trans. Syst. Man Cybern..

[15]  Steven R. Rasmussen,et al.  Task allocation for wide area search munitions , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[16]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[17]  P. Chandler,et al.  Cooperative Operations in Urban Terrain (COUNTER) , 2006, SPIE Defense + Commercial Sensing.

[18]  Mandell Bellmore,et al.  Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.

[19]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .