A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree

Journal of Combinatorial Optimization

Volumn 5, Issue 2, 2001, Pages 213-231

  Asano, Tetsuo ^a   Katoh, Naoki ^b   Kawashima, Kazuhiro ^a,c  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c Fujisoft ABC Inc   (Japan)

Author keywords

Approximation algorithm; Capacitated vehicle routing

Indexed keywords

EID: 0041827248     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011461300596     Document Type: Article

References (18)

1. K. Altinkemer and B. Gavish, "Heuristics for delivery problems with constant error guarantees," Transportation Science, vol. 24, pp. 294-297, 1990.
2. T. Asano, N. Katoh, H. Tamaki, and T. Tokuyama, "Covering points in the plane by k-tours : towards a polynomial time approximation scheme for general k," in Proc. of 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 275-283.
3. I. Averbakh and O. Berman, "Sales-delivery man problems on treelike networks," Networks, vol. 25, pp. 45-58, 1995.
4. N. Christofides, "Worst-case analysis of a new heuristic for the traveling salesman problem," Graduate School of Industrial Administration, Report 388, 1976.
5. N. Christofides, A. Mingozzi, and P. Toth, "The vehicle routing problem," in Combinatorial Optimization, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi (Eds.), John Wiley & Sons Ltd, London,1979.
6. J.P. Crouzeix, J. A. Ferland, and S. Schaible, "An algorithm for generalized fractional programs," J. of Optimization Theory and Applications, vol. 47, pp. 35-49, 1985.
7. J.P. Crouzeix, J.A. Ferland, and S. Schaible,"A note on an algorithm for generalized fractional programs," J. of Optimization Theory and Applications, vol. 50, pp. 183-187, 1986.
8. M. Desrochers, J.K. Lenstra, and M.W.P. Savelsbergh, "A classification scheme for vehicle routing and scheduling problems," Eur. J. Oper. Res. vol. 46, pp. 322-332, 1990.
9. M.L. Fischer, "Vehicle Routing," in Network Routing, Handbooks in Operations Research and Management Science, vol. 8, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Elsevier Science: Amsterdam, 1995, pp. 1-33.
10. G.N. Frederickson, "Notes on the complexity of a simple transportation problem," SIAM J. Computing, vol. 22, no. 1, pp. 57-61, 1993.
11. G.N. Frederickson and D. Guan, "Preemptive ensemble motion planning on a tree," SIAM J. Computing, vol. 21, no. 6, pp. 1130-1152, 1992.
12. B.L. Golden, "Introduction to and recent advances in vehicle routing methods," in Transportation Planning Models, M. Florian (Ed.), Elsevier Sci. Publ. B. V. (North Holland), Amsterdam, 1984, pp. 383-418.
13. B.L. Golden and A.A. Assad (Eds.). Vehicle Routing: Methods and Studies, Studies in Manag. Science and Systems, vol. 16, North-Holland Publ.: Amsterdam, 1988.
14. M. Haimovich and A.H.G. Rinnooy Kan, "Bounds and heuristics for capacitated routing problems," Mathematics of Operations Research, vol. 10, no. 4, pp. 527-542, 1985.
15. S. Hamaguchi and N. Katoh, "A capacitate vehicle routing problem on a tree," in Proc. of ISAAC'98. Lecture Notes in Computer Science, vol. 1533, Springer-Verlag, Berlin, pp. 397-406, 1998.
16. Y. Karuno, H. Nagamochi, and T. Ibaraki, "Vehicle scheduling on a tree with release and handling times," in Proc. of ISAAC'93. Lecture Notes in Computer Science, vol. 762, Springer-Verlag, Berlin, pp. 486-495, 1993.
17. Y. Karuno, H. Nagamochi, and T. Ibaraki, "Vehicle scheduling on a tree to minimize maximum lateness," Journal of the Operations Research Society of Japan, vol. 39, no. 3, pp. 345-355, 1996.
18. M. Labbé, G. Laporte, and H. Mercure, "Capacitated vehicle routing problems on trees," Operations Research, vol. 39, no. 4, pp. 616-622, 1991.