Skip to main content
SpringerLink
Log in

A Tight Approximation Algorithm for Multi-Vehicle CVRP with Unsplittable Demands on a Line

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

In this paper, the authors study the multi-vehicle capacitated vehicle routing problem on a line-shaped network with unsplittable demand. The objective is to find a transportation scheme to minimize the longest distance traveled by a single vehicle such that all the customers are served without violating the capacity constraint. The authors show that this problem has no polynomial-time algorithm with performance ratio less than 2 on condition that P ≠ NP, and then provide a 2-approximation algorithm.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gao Q and Lu X W, The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail, Journal of Systems Science & Complexity, 2016, 29(5): 1302–1319.

    Article  MathSciNet  Google Scholar 

  2. Hamaguchi S and Katoh N, A capacitated vehicle routing problem on a tree, International Symposium on Algorithms and Computation, Springer, Berlin, Heidelbarg, 1998, 399–407.

    Chapter  Google Scholar 

  3. Zhang T H, Zhao F, Zhang J L, et al., An approximation of the customer waiting time for online restaurants owning delivery system, Journal of Systems Science & Complexity, 2019, 32(3): 907–931.

    Article  MathSciNet  Google Scholar 

  4. Dantzig G and Ramser J, The truck dispatching problem, Management Science, 1959, 6(1): 80–91.

    Article  MathSciNet  Google Scholar 

  5. Altinkemer K and Gavish B, Heuristics for unequal weight delivery problem with a fixed error guarantee, Operational Research Letters, 1987, 6: 149–158.

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  7. Asano T, Katoh N, and Kawashima K, A new approximation algorithm for the capacitated vehicle routing problem on a tree, Journal of Combinatorial Optimization, 2001, 5(2): 213–231.

    Article  MathSciNet  Google Scholar 

  8. Becker A, A tight 4/3 approximation for capacitated vehicle routing in trees, Leibniz International Proceedings in Informatics, 2018, 116(1): 3–13.

    MathSciNet  MATH  Google Scholar 

  9. Labbé M, Laporte G, and Mercure H, Capacitated vehicle routing on trees, Operations Research, 1991, 39(4): 616–622.

    Article  Google Scholar 

  10. Zhang G C, Cai X Q, Lee C Y, et al., Minimizing makespan on a single batch processing machine with nonidentical job sizes, Naval Research Logistics, 2001, 48(3): 226–240.

    Article  MathSciNet  Google Scholar 

  11. Dósa G, Tan Z Y, Tuza Z, et al., Improve bounds for batch scheduling with nonidentical job sizes, Naval Research Logistics, 2014, 61(5): 351–358.

    Article  MathSciNet  Google Scholar 

  12. Dósa G and Sgall J, First fit bin packing: A tight analysis, Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science (ed. by Portier N and Wilke T), Kiel, 2013.

  13. Wu Y X and Lu X W, Capacitated vehicle routing problem on line with unsplittable demands, Journal of Combinatorial Optimization, 2020, DOI: https://doi.org/10.1007/s10878-020-00565-5.

Download references

Author information

Authors and Affiliations

  1. School of Science, East China University of Science and Technology, Shanghai, 200237, China

    Yuanxiao Wu & Xiwen Lu

Authors
  1. Yuanxiao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiwen Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Yuanxiao Wu or Xiwen Lu.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant Nos. 11871213 and 71431004.

This paper was recommended for publication by Editor CHAI Jian.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, Y., Lu, X. A Tight Approximation Algorithm for Multi-Vehicle CVRP with Unsplittable Demands on a Line. J Syst Sci Complex 35, 1902–1909 (2022). https://doi.org/10.1007/s11424-022-0280-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-022-0280-z

Keywords

Search

Navigation