Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem

International Journal of Robust and Nonlinear Control

Volumn 21, Issue 12, 2011, Pages 1434-1451

  Doshi, Riddhi ^a   Yadlapalli, Sai ^a   Rathinam, Sivakumar ^a   Darbha, Swaroop ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

approximation algorithms; Hamiltonian path; heterogeneous vehicles; heuristics; vehicle routing

Indexed keywords

COMPUTATIONAL RESULTS; DEGREE CONSTRAINTS; HAMILTONIAN PATH; HAMILTONIAN PATH PROBLEMS; HETEROGENEOUS VEHICLES; HEURISTICS; INTEGER PROGRAMMING MODELS; INTEGRALITY CONSTRAINTS; LIN-KERNIGHAN; LINEAR PROGRAMS; NP-HARD; OPTIMAL SOLUTIONS; PROBLEM SIZE; QUALITY OF SOLUTION; ROUTING PROBLEMS; SEQUENCING PROBLEMS; SURVEILLANCE APPLICATIONS;

COMPUTER PROGRAMMING; HAMILTONIANS; INTEGER PROGRAMMING; PROBLEM SOLVING; VEHICLES;

APPROXIMATION ALGORITHMS;

EID: 79960101383     PISSN: 10498923     EISSN: 10991239     Source Type: Journal    
DOI: 10.1002/rnc.1701     Document Type: Article

References (33)

1. Garey MR, Johnson DS,. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.: New York, 1990.
2. Vazirani VV,. Approximation Algorithms. Springer: Berlin, 2001.
3. West DB,. Introduction to Graph Theory. Prentice-Hall: Upper Saddle River, NJ, 1996.
4. Gutin G, Punnen AP,. The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers: Dorderecht, The Netherlands, 2002.
5. Christofides N,. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1976.
6. Papadimitriou CH, Yannakakis M,. The traveling salesman problem with distances one and two. Mathematics of Operations Research 1993; 18 (1): 1-11.
7. Arora S,. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM 1998; 45 (5): 753-782. DOI: http://doi.acm.org.lib-ezproxy.tamu.edu:2048/10.1145/ 290179.290180. (Pubitemid 128497506)
8. Hoogeveen J,. Analysis of Christofides' heuristic: some paths are more difficult than cycles. Operations Research Letters 1991; 10 (5): 291-295.
9. Chekuri C, P Ãl M,. An O(logn) approximation ratio for the asymmetric traveling salesman path problem. Theory of Computing 2007; 3 (1): 197-209. DOI: 10.4086/toc.2007.v003a010.
10. Dantzig GB, Fulkerson DR, Johnson SM,. On a linear-programming, combinatorial approach to the traveling-salesman problem. Operations Research 1959; 7 (1): 58-66.
11. Miller CE, Tucker AW, Zemlin RA,. Integer programming formulation of traveling salesman problems. Journal of the ACM 1960; 7 (4): 326-329. DOI: http://doi.acm.org.lib-ezproxy.tamu.edu:2048/10.1145/321043.321046.
12. Applegate D, Bixby R, Chvatal V, Cook W,. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming 2003; 97 (1): 91-153.
13. Lin S, Kernighan B,. An effective heuristic algorithm for the traveling-salesman problem. Operations Research 1973; 21: 498-516.
14. Kara I, Bektas T,. Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research 2006; 174 (3): 1449-1458. (Pubitemid 44209143)
15. Gavish B, Srikanth K,. An optimal solution method for large-scale multiple traveling salesmen problems. Operations Research 1986; 34 (5): 698-717. (Pubitemid 17590502)
16. Laporte G, Nobert Y,. A cutting planes algorithm for the m-salesmen problem. The Journal of the Operational Research Society 1980; 31 (11): 1017-1023. (Pubitemid 11456552)
17. Bektas T,. The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 2006; 34 (3): 209-219. DOI: 10.1016/j.omega.2004.10.004. (Pubitemid 41600559)
18. Malik W, Rathinam S, Darbha S,. An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem. Operations Research Letters 2007; 35 (6): 747-753. DOI: 10.1016/j.orl.2007.02. 001. (Pubitemid 47483976)
19. Rathinam S, Sengupta R,. Lower and upper bounds for a multiple depot UAV routing problem. The 45th IEEE Conference on Decision and Control, San Diego, CA, 2006; 5287-5292. (Pubitemid 351283820)
20. Cardon S, Dommers S, Eksin C, Sitters R, Stougie A, Stougie L,. A PTAS for the multiple depot vehicle routing problem. Report, Technische Universiteit Eindhoven, 2008.
21. Rathinam S, Sengupta R,. 3/2-Approximation algorithm for two variants of a 2-depot Hamiltonian path problem. Operations Research Letters 2010; 38 (1): 63-68.
22. Rathinam S, Sengupta R,. Algorithms for routing problems involving UAVs. Innovations in Intelligent Machinesâ1. Studies in Computational Intelligence. Springer: Berlin, Heidelberg, 2007; 147-172.
23. Magnanti TL, Wolsey LA,. Optimal trees. Operations Research Center Working Paper OR 290-94, Massachusetts Institute of Technology, Operations Research Center, 1994.
24. Goemans MX, Williamson DP,. A general approximation technique for constrained forest problems. SODA '92: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics: Philadelphia, PA, 1992; 307-316.
25. Rathinam S,. Routing and monitoring algorithms for UAVs. Dissertation, University of California, Berkeley, 2007.
26. Helsgaun K,. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 2000; 126 (1): 106-130. DOI: 10.1016/S0377-2217(99)00284-2.
27. Helsgaun K,. General k-opt submoves for the Lin-Kernighan tsp heuristic. Mathematical Programming Computation 2009; 1 (2): 119-163.
28. International Business Machines. Available from:.
29. Siek J, Lee L, Lumsdaine A,. Boost Graph Library: The User Guide and Reference Manual. Addison-Wesley Professional: Reading, MA, 2002.
30. Kolmogorov V,. Blossom V: a new implementation of a minimum cost perfect matching algorithm. Mathematical Programming Computation 2009; 1 (1): 43-67.
31. Edmonds J,. Paths, trees and flowers. Canadian Journal of Mathematics 1965; 1 (17): 449-467.
32. Helsgaun K,. LKH, July 2009.
33. Reeds J, Shepp L,. Optimal paths for a car that goes both forwards and backwards. Pacific Journal of Mathematics 1990; 145 (2): 367-393.