The capacitated traveling salesman problem with pickups and deliveries on a tree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 1061-1070

  Lim, Andrew ^a   Wang, Fan ^a   Xu, Zhou ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33744965150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_105     Document Type: Conference Paper

References (15)

1. S. Anily and J. Bramel. Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Research Logistics, 56:654-670, 1999.
2. S. Anily, M. Gendreau, and G. Laporte. The swapping problem on a line. SIAM Jounral on Computing., 29(1):327-335, 1999.
3. S. Anily and R. Hassin. The swapping problem. Networks, 22:419-433, 1992.
4. T. Asano, N. Katoh, and K. Kawashima. A new approximation algorithm for the capacitated vehicle routing problems on a tree. Journal of Combinatorial Optimization, 5(2):213-231, 2000.
5. C. Basnet, L.R. Foulds, and J.M. Wilson. Heuristics for vehicle routing on tree-like networks. Journal of the Operational Research Society, 50:627-635, 1999.
6. P. Chalasani and R. Motwani. Approximating capacitated routing and delivery problems. SIAM J. Comput., 28(6):2133-2149, 1999.
7. G. N. Frederickson. Notes on the complexity of a simple transportation problem. SIAM J. Comput., 22:57-61, 1993.
8. G. N. Frederickson and D. Guan. Preemptive ensemble motion planning on a tree. SIAM J. Comput., 21:1130-1152, 1992.
9. G. N. Frederickson, M. S. Hecht, and C. E. Kim. Approximation algorithms for some routing problems. SIAM J. Comput., 7:178-193, 1978.
10. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
11. Shinya Hamaguchi and Naoki Katoh. A capacitated vehicle routing problem on a tree. Proc. of ISAAC98, Lecture Notes in Computer Science, pages 397-407, 1998.
12. H. Hernandez-Perez and J.J. Salazar-Gonzalez. Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science, 38(2):245-255, 2004.
13. Y. Karuno, H. Nagamochi, and T. Ibaraki. Vehicle scheduling on a tree with release and handling times. Proc. of ISAAC93, Lecture Notes in Computer Science, pages 486-495, 1993.
14. M. Labbe, G. Laporte, and H. Mercure. Capacitated vehicle routing problems on trees. Operations Research, 39(2):616-622, 1991.
15. A. Lim, F. Wang, and Z. Xu. A 2-approximation algorithm for capacitated traveling salesman problem with pickup and delivery on a tree (complete version), Sept. 2005. Working Paper, Hong Kong University of Science and Technology.