Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded... 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). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Algorithms (TALG) Association for Computing Machinery

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

Download PDF
36 pages

Loading next page...
 
/lp/association-for-computing-machinery/approximation-schemes-for-capacitated-vehicle-routing-on-graphs-of-kyyBpbcrjk

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM.
ISSN
1549-6325
eISSN
1549-6333
DOI
10.1145/3582500
Publisher site
See Article on Publisher Site

Abstract

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).

Journal

ACM Transactions on Algorithms (TALG) – Association for Computing Machinery

Published: Mar 9, 2023

Keywords: Approximation scheme

References

  • PTAS for k-Tour cover problem on the plane for moderately large values of k
    [,
  • Heuristics for unequal weight delivery problems with a fixed error guarantee
    [,
  • Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems
    [,
  • Covering points in the plane by k-Tours: Towards a polynomial time approximation scheme for general k
    [,
  • A tight 4/3 approximation for capacitated vehicle routing in trees
    [,
  • A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
    [,
  • Polynomial-Time approximation schemes for k-center, k-median, and capacitated vehicle routing in bounded highway dimension
    [,
  • A PTAS for bounded-capacity vehicle routing in planar graphs
    [,
  • A framework for vehicle routing approximation schemes in trees
    [,
  • Improving the approximation ratio for capacitated vehicle routing
    [,
  • Parallel algorithms with optimal speedup for bounded treewidth
    [,
  • On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs
    [,
  • A path-decomposition theorem with applications to pricing and covering on trees
    [,
  • The truck dispatching problem
    [,
  • A quasipolynomial time approximation scheme for euclidean capacitated vehicle routing
    [,
  • A (1+ \(\epsilon\) )-Embedding of low highway dimension graphs into bounded treewidth graphs
    [,
  • Improved approximations for capacitated vehicle routing with unsplittable client demands
    [,
  • Capacitated arc routing problems
    [,
  • Bounds and heuristics for capacitated routing problems
    [,
  • A capacitated vehicle routing problem on a tree
    [,
  • PTAS for the euclidean capacitated vehicle routing problem in R****d
    [,
  • QPTAS for the CVRP with a moderate number of routes in a metric space of any fixed doubling dimension
    [,
  • An extension of the das and mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
    [,
  • Capacitated vehicle routing on trees
    [,
  • A PTAS for capacitated vehicle routing on trees
    [,
  • A tight \((\frac{3}{2}+\epsilon)\) -Approximation for unsplittable capacitated vehicle routing on trees
    [,
  • Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis (2nd
    [,
  • The traveling salesman problem with distances one and two
    [,
  • Bypassing the embedding: Algorithms for low dimensional metrics
    [,
  • Disk Covering Problem
    Weisstein, Eric W.