Capacitated vehicle routing problem on line with unsplittable demands (original) (raw)

Abstract

In this paper we study the capacitated vehicle routing problem. An instance of capacitated vehicle routing problem consists of a set of vertices with demands in a metric space, a specified depot, and a capacity bound C. The objective is to find a set of tours originating at the depot that cover all the demands, such that the capacity of each tour does not exceed C and the sum of the tour lengths is minimized. For the case that the metric space is a line and the demands are unsplittable, we provide a \(\frac{5}{3}\)-approximation algorithm. An instance is given to show that the bound is tight.

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

• Altinkemer K, Gavish B (1990) Heuristics for delivery problems with constant error guarantees. Transp Sci 24:294–297
  Article Google Scholar
• Asano T, Katoh N, Kawashima K (2001) A new approximation algorithm for the capacitated vehicle routing problem on a tree. J Comb Optim 5(2):213–231
  Article MathSciNet Google Scholar
• Becker A (2018) A tight 4/3 approximation for capacitated vehicle routing in trees. Leibniz Int Proc Inform 116(1):3
  MathSciNet MATH Google Scholar
• Dósa G, Sgall J (2013) First Fit bin packing: a tight analysis. In: Proceedings of the \(30\)th symposium on theoretical aspects of computer science, Kiel
• Dósa G, Tan ZY, Tuza Z, Yan YJ, Lányi CS (2014) Improve bounds for batch scheduling with nonidentical job sizes. Naval Res Logist 61(5):351–358
  Article MathSciNet Google Scholar
• Haimovich M (1985) Bounds and heuristics for capacitated routing problems. Math Oper Res 10(4):527–542
  Article MathSciNet Google Scholar
• Hamaguchi S, Katoh N (1998) A capacitated vehicle routing problem on a tree. In: International symposium on algorithms and computation, pp 399–407
• Labbé M, Laporte G, Mercure H (1991) Capacitated vehicle routing on trees. Oper Res 39(4):616–622
  Article Google Scholar
• Laporte G, Nobert Y (1983) A branch and bound algorithm for the capacitated vehicle routing problem. OR Spektrum 5:77–85
  Article Google Scholar
• Zhang GC, Cai XQ, Lee CY, Wong CK (2001) Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Res Logist 48(3):226–240
  Article MathSciNet Google Scholar

Download references

Acknowledgements

Dedicated to Professor Minyi Yue on the Occasion of His 100th Birthday. This work is supported by National Natural Science Foundation of China (NSFCs: Nos. 11871213 and 71431004 ).

Author information

Authors and Affiliations

1. School of Science, East China University of Science and Technology, Shanghai, China
   Yuanxiao Wu & Xiwen Lu

Authors

1. Yuanxiao Wu
2. Xiwen Lu

Corresponding author

Correspondence toXiwen Lu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

About this article

Cite this article

Wu, Y., Lu, X. Capacitated vehicle routing problem on line with unsplittable demands.J Comb Optim 44, 1953–1963 (2022). https://doi.org/10.1007/s10878-020-00565-5

Download citation

• Published: 08 April 2020
• Version of record: 08 April 2020
• Issue date: October 2022
• DOI: https://doi.org/10.1007/s10878-020-00565-5

Keywords