Abstract
Given \(\lambda >0\), an undirected complete graph \(G=(V,E)\) with nonnegative edge-weight function obeying the triangle inequality and a depot vertex \(r\in V\), a set \(\{C_1,\ldots ,C_k\}\) of cycles is called a \(\lambda \)-bounded r-cycle cover if \(V \subseteq \bigcup _{i=1}^k V(C_i)\) and each cycle \(C_i\) contains r and has a length of at most \(\lambda \). The Distance Constrained Vehicle Routing Problem with the objective of minimizing the total cost (DVRP-TC) aims to find a \(\lambda \)-bounded r-cycle cover \(\{C_1,\ldots ,C_k\}\) such that the sum of the total length of the cycles and \(\gamma k\) is minimized, where \(\gamma \) is an input indicating the assignment cost of a single cycle. For DVRP-TC on tree metric, we show a 2-approximation algorithm and give an LP relaxation whose integrality gap lies in the interval [2,\(\frac{5}{2}\)]. For the unrooted version of DVRP-TC, we devise a 5-approximation algorithm and give an LP relaxation whose integrality gap is between 2 and 25. For unrooted DVRP-TC on tree metric we develop a 3-approximation algorithm. For unrooted DVRP-TC on line metric we obtain an \(O(n^3)\) time exact algorithm, where n is the number of vertices. Moreover, we give some examples to demonstrate that our results can also be applied to the path-version of (unrooted) DVRP-TC.
Similar content being viewed by others
References
Arkin EM, Hassin R, Levin A (2006) Approximations for minimum and min-max vehicle routing problems. J Algorithms 59:1–18
Assad AA (1988) Modeling and implementation issues in vehicle routing. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North Holland, Amsterdam, pp 7–45
Chen Q, Huang X, Ran Y (2018) Approximation algorithm for distance constraint sweep coverage without predetermined base stations. Discrete Math Algorithms Appl 10(5):1850064
Frederickson GN, Hecht MS, Kim CE (1978) Approximation algorithms for some routing problems. SIAM J Comput 7(2):178–193
Friggstad Z, Swamy C (2014) Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. In: The proceedings of the 46th annual ACM symposium on theory of computing, pp 744–753
Garey M, Johnson D (1979) Computers and intractability. Freeman, San Francisco
Khani MR, Salavatipour MR (2014) Improved approximation algorithms for min-max tree cover and bounded tree cover problems. Algorithmica 69:443–460
Li CL, Simchi-Levi D, Desrochers M (1992) On the distance constrained vehicle routing problem. Oper Res 40:790–799
Liang J, Huang X, Zhang Z (2019) Approximation algorithms for distance constraint sweep coverage with base stations. J Combin Optim 37:1111–1125
Nagarajan V, Ravi R (2006) Minimum vehicle routing with a common deadline. In: Diaz J, Jansen K, Rolim JDP, Zwick U (eds) the Proceeding of the 9th international workshop on approximation algorithms for combinatorial optimization problems. Lecture notes in computer science, vol 4110, pp 212–223, Springer, Heidelberg
Nagarajan V, Ravi R (2008) Approximation algorithms for distance constrained vehicle routing problems. Carnegie Mellon University, Pittsburgh
Nagarajan V, Ravi R (2012) Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2):209–214
Xu W, Liang W, Lin X (2015) Approximation algorithms for min–max cycle cover problems. IEEE Trans Comput 64:600–613
Xu Z, Xu D, Zhu W (2012) Approximation results for a min–max location-routing problem. Discrete Appl Math 160:306–320
Yu W, Liu Z (2016) Improved approximation algorithms for some min–max and minimum cycle cover problems. Theoret Comput Sci 654:45–58
Yu W, Liu Z, Bao X (2019) New approximation algorithms for the minimum cycle cover problem. Theor Comput Sci 793:44–58
Yu W, Liu Z, Bao X (2020) New LP relaxations for minimum cycle/path/tree cover problems. Theor Comput Sci 803:71–81
Acknowledgements
We are grateful to the anonymous referees for their valuable and constructive comments. This research is supported by the National Natural Science Foundation of China under Grants Numbers 11671135, 11871213, 11701363, the Natural Science Foundation of Shanghai under Grant Number 19ZR1411800 and the Fundamental Research Fund for the Central Universities under Grant Number 22220184028.
Author information
Authors and Affiliations
Corresponding author
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
Yu, W., Liu, Z. & Bao, X. Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity. J Comb Optim 43, 1405–1422 (2022). https://doi.org/10.1007/s10878-020-00669-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00669-y