Advertisement

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

  • Tetsuo Asano
  • Kazuhiro Kawashima
  • Naoki Katoh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)

Abstract

This paper presents a new approximation algorithm for a vehicle routing problem on a tree-shaped network with a single depot. Customers are located on vertices of the tree. 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. We propose a 1.35078-approximation algorithm for the problem (exactly, \( (\sqrt {41} - 1)/4) \) , which is an improvement over the existing 1.5-approximation.

Keywords

Approximation Algorithm Problem Instance Internal Node Approximation Ratio Capacitate Vehicle Route Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    I. Averbakh and O. Berman, Sales-delivery man problems on treelike networks, Networks, 25 (1995), 45–58.Google Scholar
  2. 2.
    J.P. Crouzeix, J.A. Ferland and S. Schaible, An algorithm for generalized fractional programs, J. of Optimization Theory and Applications, 47 (1985), 35–49.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    G. Frederickson, Notes on the complexity of a simple transportation problem, SIAM J. Computing, 22-1 (1993), 57–61.Google Scholar
  5. 5.
    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
  6. 6.
    S. Hamaguchi and N. Katoh. A Capacitate Vehicle Routing Problem on a Tree, Proc. of ISAAC’98, LNCS 1533, Springer-Verlag 397–406, 1998.Google Scholar
  7. 7.
    Y. Karuno, H. Nagamochi, T. Ibaraki, Vehicle Scheduling on a Tree with Release and Handling Times, Proc. of ISAAC’93, LNCS 762, Springer-Verlag 486–495, 1993.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    M. Labbé, G. Laporte and H. Mercure. Capacitated Vehicle Routing Problems on Trees, Operations Research, Vol. 39 No. 4 (1991) 616–622.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Tetsuo Asano
    • 1
  • Kazuhiro Kawashima
    • 1
  • Naoki Katoh
    • 2
  1. 1.JAISTSchool of Information ScienceAsahidaiJapan
  2. 2.Department of Architecture and Architectural SystemsKyoto UniversitySakyo-kuJapan

Personalised recommendations