Access the full text.
Sign up today, get DeepDyve free for 14 days.
Amariah Becker, P. Klein, Aaron Schild (2019)
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
Anna Adamaszek, A. Czumaj, A. Lingas (2009)
PTAS for k-tour cover problem on the plane for moderately large values of kArXiv, abs/0904.2576
M. Khachay, R. Dubinin (2016)
PTAS for the Euclidean Capacitated Vehicle Routing Problem in R^d
, Hannah Bast , and Grzegorz Herman ( Eds . )
Amariah Becker, Alice Paul (2018)
A Framework for Vehicle Routing Approximation Schemes in Trees
J. Blauth, Vera Traub, J. Vygen (2020)
Improving the approximation ratio for capacitated vehicle routingMathematical Programming, 197
J. Pierce (1971)
ON THE TRUCK DISPATCHING PROBLEM
M. Khachay, Y. Ogorodnikov (2020)
QPTAS for the CVRP with a Moderate Number of Routes in a Metric Space of Any Fixed Doubling Dimension
Eric W. Weisstein (2018)
Disk Covering ProblemFrom MathWorld–A Wolfram Web Resource(2018). https://mathworld.wolfram.com/DiskCoveringProblem.html
Each triple ( t s,x,z,i , h s,x,z,i , l s,x,z,i ) has (nQ) O(log 2 n/ ) possibilities
Amariah Becker, P. Klein, David Saulpic (2017)
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
Each t s,x,z,i has n O
Since there are n O(k 2 log Q log 2 n/ 2 ) possibilities for y s
(2018)
Disk covering problem. From MathWorld-A Wolfram Web Resource
Kunal Talwar (2004)
Bypassing the embedding: algorithms for low dimensional metrics
M. Haimovich, A. Kan (1985)
Bounds and Heuristics for Capacitated Routing ProblemsMath. Oper. Res., 10
[ (1995)
Parallel algorithms with optimal speedup for bounded treewidthProceedings of the Automata, 944
T. Asano, N. Katoh, H. Tamaki, T. Tokuyama (1997)
Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k
Sanjeev Arora (1998)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJ. ACM, 45
Claire Mathieu, Hang Zhou (2023)
A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees
C. Papadimitriou, M. Yannakakis (1993)
The Traveling Salesman Problem with Distances One and TwoMath. Oper. Res., 18
Amariah Becker (2018)
A Tight 4/3 Approximation for Capacitated Vehicle Routing in TreesArXiv, abs/1804.08791
Vincent Cohen-Addad, Arnold Filtser, P. Klein, Hung Le (2020)
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
Marek Cygan, F. Grandoni, S. Leonardi, Marcin Pilipczuk, P. Sankowski (2012)
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
M. Khachay, Y. Ogorodnikov, D. Khachay (2020)
An Extension of the Das and Mathieu QPTAS to the Case of Polylog Capacity Constrained CVRP in Metric Spaces of a Fixed Doubling Dimension
Aparna Das, Claire Mathieu (2008)
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle RoutingAlgorithmica, 73
B. Golden, R. Wong (1981)
Capacitated arc routing problemsNetworks, 11
[ (2022)
A tight \((\frac{3}{2}+\epsilon)\) -Approximation for unsplittable capacitated vehicle routing on trees(2022). DOI:DOI:10.48550/ARXIV.2202.05691
A. Feldmann, W. Fung, J. Könemann, Ian Post (2015)
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, M. Salavatipour (2022)
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands
Each h s,x,z,i and l s,x,z,i have n O(g) possibilities. Recall that g = (2δ log n)/ , so each h s,x,z,i and l s,x,z
Since p s,u,v has τ = O(log Q/ ) many such triples, the number of possible entries for p s,u,v is (nQ) O(τ log 2 n/ ) = (nQ) O(log
[ (2015)
A (1+ \(\epsilon\) )-Embedding of low highway dimension graphs into bounded treewidth graphsProceedings of the Automata, 9134
Shin-ya Hamaguchi, N. Katoh (1998)
A Capacitated Vehicle Routing Problem on a Tree
Claire Mathieu, Hang Zhou (2021)
A PTAS for Capacitated Vehicle Routing on TreesACM Transactions on Algorithms, 19
K. Altinkemer, B. Gavish (1987)
Heuristics for unequal weight delivery problems with a fixed error guaranteeOperations Research Letters, 6
G. Dantzig, J. Ramser (1959)
The Truck Dispatching ProblemManagement Science, 6
M. Labbé, G. Laporte, H. Mercure (1991)
Capacitated Vehicle Routing on TreesOper. Res., 39
H. Bodlaender, T. Hagerup (1995)
Parallel Algorithms with Optimal Speedup for Bounded TreewidthSIAM J. Comput., 27
Amariah Becker, P. Klein, David Saulpic (2018)
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
(2017)
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
In this article, we present Approximation Schemes for Capacitated Vehicle Routing Problem (CVRP) on several classes of graphs. In CVRP, introduced by Dantzig and Ramser in 1959 [14], we are given a graph G=(V,E) with metric edges costs, a depot r ∈ V, and a vehicle of bounded capacity Q. The goal is to find a minimum cost collection of tours for the vehicle that returns to the depot, each visiting at most Q nodes, such that they cover all the nodes. This generalizes classic TSP and has been studied extensively. In the more general setting, each node v has a demand dv and the total demand of each tour must be no more than Q. Either the demand of each node must be served by one tour (unsplittable) or can be served by multiple tours (splittable). The best-known approximation algorithm for general graphs has ratio α +2(1-ε) (for the unsplittable) and α +1-ε (for the splittable) for some fixed \(ε \gt \frac{1}{3000}\) , where α is the best approximation for TSP. Even for the case of trees, the best approximation ratio is 4/3 [5] and it has been an open question if there is an approximation scheme for this simple class of graphs. Das and Mathieu [15] presented an approximation scheme with time nlogO(1/ε)n for Euclidean plane ℝ2. No other approximation scheme is known for any other class of metrics (without further restrictions on Q). In this article, we make significant progress on this classic problem by presenting Quasi-Polynomial Time Approximation Schemes (QPTAS) for graphs of bounded treewidth, graphs of bounded highway dimensions, and graphs of bounded doubling dimensions. For comparison, our result implies an approximation scheme for the Euclidean plane with run time nO(log6n/ε5).
ACM Transactions on Algorithms (TALG) – Association for Computing Machinery
Published: Mar 9, 2023
Keywords: Approximation scheme
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.