Skip to main content
SpringerLink
Log in

A Capacitated Vehicle Routing Problem on a Tree

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1533))

Included in the following conference series:

Abstract

In this paper we deal with a vehicle routing problem on a tree-shaped network with a single depot. Customers are located on vertices of the tree, and each customer has a positive demand. Demands of customers are served by a fleet of identical vehicles with limited capacity. It is assumed that the demand of a customer is splittable, i.e., it can be served by more than one vehicle. The problem we are concerned with in this paper asks to find a set of tours of the vehicles with minimum total lengths. Each tour begins at the depot, visits a subset of the customers and returns to the depot without violating the capacity constraint. We show that the problem is NP-complete and propose a 1.5-approximation algorithm for the problem. We also give some computational results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Altinkemer and B. Gavish, Heuristics for delivery problems with constant error guarantees, Transportation Science, 24 1990, 294–297.

    Article  MATH  Google Scholar 

  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.

    Google Scholar 

  3. I. Averbakh and O. Berman, Sales-delivery man problems on treelike networks, Networks, 25 1995, 45–58.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, 1976.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  Google Scholar 

  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.

    Chapter  Google Scholar 

  8. G. Frederickson, Notes on the complexity of a simple transportation problem, SIAM J. Computing, 22-1 1993, 57–61.

    Article  MathSciNet  Google Scholar 

  9. G. Frederickson and D. Guan, Preemptive ensemble motion planning on a tree, SIAM J. Computing, 21-6 1992, 1130–1152.

    Article  MathSciNet  Google Scholar 

  10. M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    MATH  MathSciNet  Google Scholar 

  17. M. Labbé, G. Laporte and H. Mercure. Capacitated Vehicle Routing Problems on Trees, Operations Research, Vol. 39 No. 4 1991 616–622.

    MATH  Google Scholar 

  18. G. Laporte. The Vehicle Routing Problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59 1992 345–358.

    Article  MATH  Google Scholar 

  19. J.K. Lenstra and A.H.G. Rinooy Kan. Complexity of Vehicle Routing and Scheduling Problem. Networks, 11 1981 221–227.

    Article  Google Scholar 

  20. K. Lund VRP References-Part I/II. WWW home page, http://www.imm.dtu.dk/documents/users/kl/vrp_1.html

Download references

Author information

Authors and Affiliations

  1. Information System Promotion Division, Osaka Prefectural Government, Osaka, 540-8570, Japan

    Shin-ya Hamaguchi

  2. Department of Architecture and Architectural Systems, Kyoto University, Kyoto, 606-8501, Japan

    Naoki Katoh

Authors
  1. Shin-ya Hamaguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naoki Katoh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusong-dong, Yusong-gu, Taejon, 305-701, Korea

    Kyung-Yong Chwa

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamaguchi, Sy., Katoh, N. (1998). A Capacitated Vehicle Routing Problem on a Tree. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65385-1

  • Online ISBN: 978-3-540-49381-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation