A capacitated vehicle routing problem on a tree

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

Volumn 1533 LNCS, Issue , 1998, Pages 397-407

  Hamaguchi, Shin Ya ^a   Katoh, Naoki ^b  

^a Osaka Prefectural Government   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FLEET OPERATIONS; FORESTRY; SALES; TREES (MATHEMATICS); VEHICLE ROUTING;

CAPACITATED VEHICLE ROUTING PROBLEM; CAPACITY CONSTRAINTS; COMPUTATIONAL RESULTS; LIMITED CAPACITY; NP COMPLETE; TOTAL LENGTH; TREE SHAPED NETWORK; VEHICLE ROUTING PROBLEMS;

VEHICLES;

EID: 84867472446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_42     Document Type: Conference Paper

References (20)

1. K. Altinkemer and B. Gavish, Heuristics for delivery problems with constant error guarantees, Transportation Science, 24 (1990), 294-297.
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, Proc. of 29th Annual ACM Symposium on Theory of Computing, pp.275-283, 1997.
3. I. Averbakh and O. Berman, Sales-delivery man problems on treelike networks, Networks, 25 (1995), 45-58.
4. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, 1976.
5. N. Christofides, A. Mingozzi and P. Toth. The vehicle routing problem. in: N. Christofides, A. Mingozzi, P. Toth and C. Sandi, editors. Combinatorial Optimization. John Wiley & Sons Ltd, London, 1979.
6. M. Desrochers, J. K. Lenstra and M. W. P. Savelsbergh. A classification scheme for vehicle routing and scheduling problems. Eur. J. Oper. Res. 46, 322-332, 1990.
7. M.L. Fischer. Vehicle Routing. in Network Routing, Handbooks in Operations Research and Management Science, 8, Ball, M. O., T. L. Magnanti, C. L. Monma and G. L. Nemhauser (Eds.), Elsevier Science, Amsterdam, 1-33, 1995.
8. G. Frederickson, Notes on the complexity of a simple transportation problem, SIAM J. Computing, 22-1 (1993), 57-61.
9. G. Frederickson and D. Guan, Preemptive ensemble motion planning on a tree, SIAM J. Computing, 21-6 (1992), 1130-1152.
10. M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
11. 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), 383-418, 1984.
12. B.L. Golden and A. A. Assad (Eds.). Vehicle Routing: Methods and Studies, Studies in Manag. Science and Systems 16, North-Holland Publ., Amsterdam, 1988.
13. M. Haimovich and A.H.G. Rinnooy Kan. Bounds and Heuristics for capacitated routing problems Mathematics of Operations Research, 10(4), 527-542, 1985.
14. S. Hamaguchi, A study on Vehicle Routing Problems on Tree-shaped Networks, Master Thesis, Graduate School of Business Administration, Kobe Univ. of Commerce, 1998.
15. Y. Karuno, H. Nagamochi, T. Ibaraki, Vehicle Scheduling on a Tree with Release and Handling Times, Proc. of ISAAC'93, Lecture Notes in Computer Science 762, Springer-Verlag 486-495, 1993.
16. Y. Karuno, H. Nagamochi, T. Ibaraki, Vehicle Scheduling on a Tree to Minimize Maximum Lateness, Journal of the Operations Research Society of Japan, Vol. 39, No.3 (1996) 345-355.
17. M. Labbé, G. Laporte and H. Mercure. Capacitated Vehicle Routing Problems on Trees, Operations Research, Vol. 39 No. 4 (1991) 616-622.
18. G. Laporte. The Vehicle Routing Problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59 (1992) 345-358.
19. J.K. Lenstra and A.H.G. Rinooy Kan. Complexity of Vehicle Routing and Scheduling Problem. Networks, 11 (1981) 221-227.
20. K. Lund VRP References - Part I/II. WWW home page, http://www.imm.dtu.dk/ documents/users/kl/vrp1.html