An analysis of the extended Christofides heuristic for the k-depot TSP

Operations Research Letters

Volumn 39, Issue 3, 2011, Pages 218-223

  Xu, Zhou ^a   Xu, Liang ^a   Rodrigues, Brian ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

Approximation algorithms; Christofides heuristic; Multiple depots; TSP

Indexed keywords

APPROXIMATION RATIOS; CHRISTOFIDES HEURISTIC; MULTIPLE DEPOT; NON-TRIVIAL; TSP;

APPROXIMATION ALGORITHMS; HEURISTIC ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 79956144068     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2011.03.002     Document Type: Article

References (18)

1. E.M. Arkin, R. Hassin, and A. Levin Approximations for minimum and minmax vehicle routing problems Journal of Algorithms 59 1 2006 1 18
2. P.R. Chandler, M. Pachter, Research issues in autonomous control of tactical UAVs, in: Proceedings of American Control Conference, 1998, pp. 394398.
3. P.R. Chandler, M. Pachter, D. Swaroop, J.M. Fowler, J.K. Howlett, S. Rasmussen, C. Schumacher, K. Nygard, Complexity in UAV cooperative control, in: Proceedings of American Control Conference, 2002, pp. 18311836.
4. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, 1976.
5. H.A. Eiselt, M. Gendreau, and G. Laporte Arc routing problems, part i: the Chinese postman problem Operations Research 43 2 1995 231 242
6. L.R. Foulds, and J.M. Wilson A variation of the generalized assignment problem arising in the New Zealand dairy industry Annals of Operations Research 69 1997 105 114
7. Michael R. Garey, and David S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 WH Freeman & Co. New York, USA
8. I.D. Giosa, I.L. Tansini, and I.O. Viera New assignment algorithms for the multi-depot vehicle routing problem Journal of the Operational Research Society 53 9 2002 977 984 (Pubitemid 34964223)
9. B.H. Korte, and J. Vygen Combinatorial Optimization: Theory and Algorithms 2008 Springer Verlag
10. W. Malik, S. Rathinam, and S. Darbha An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem Operations Research Letters 35 6 2007 747 753 (Pubitemid 47483976)
11. C.H. Papadimitriou, and K. Steiglitz Approximation algorithms for the traveling salesman problem Combinatorial Optimization: Algorithms and Complexity 1998 Courier Dover Publications 410 419
12. S. Rathinam, R. Sengupta, 3/2-approximation algorithm for a generalized, multiple depot, Hamiltonian path problem, Technical Report, University of California, Berkeley, 2007.
13. S. Rathinam, R. Sengupta, 5/3-approximation algorithm for a multiple depot, terminal Hamiltonian path problem, Technical Report, University of California, Berkeley, 2007.
14. S. Rathinam, and R. Sengupta 3/2-approximation algorithm for two variants of a 2-depot Hamiltonian path problem Operations Research Letters 38 1 2010 63 68
15. S. Rathinam, R. Sengupta, and S. Darbha A resource allocation algorithm for multi-vehicle systems with non holonomic constraints IEEE Transactions on Automation Science and Engineering 4 1 2006 98 104
16. J. Renaud, G. Laporte, and F.F. Boctor A tabu search heuristic for the multi-depot vehicle routing problem Computers and Operations Research 23 3 1996 229 235
17. D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis An analysis of several heuristics for the traveling salesman problem SIAM Journal on Computing 6 1977 563 581
18. S. Yadlapalli, W. Malik, S. Darbha, and M. Pachter A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem Nonlinear Analysis. Real World Applications 10 4 2009 1990 1999