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.
Similar content being viewed by others
References
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.
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.
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.
Dantzig G and Ramser J, The truck dispatching problem, Management Science, 1959, 6(1): 80–91.
Altinkemer K and Gavish B, Heuristics for unequal weight delivery problem with a fixed error guarantee, Operational Research Letters, 1987, 6: 149–158.
Altinkemer K and Gavish B, Heuristics for delivery problems with constant error guarantees, Transportation Science, 1990, 24: 294–297.
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.
Becker A, A tight 4/3 approximation for capacitated vehicle routing in trees, Leibniz International Proceedings in Informatics, 2018, 116(1): 3–13.
Labbé M, Laporte G, and Mercure H, Capacitated vehicle routing on trees, Operations Research, 1991, 39(4): 616–622.
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.
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.
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.
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.
Author information
Authors and Affiliations
Corresponding authors
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
About this article
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
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-022-0280-z