A PTAS for Capacitated Vehicle Routing on Trees-Reference-Cited by-同舟云学术

A PTAS for Capacitated Vehicle Routing on Trees

Published:2023-03-10 Issue:2 Volume:19 Page:1-28
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Mathieu Claire¹^ORCID,Zhou Hang²^ORCID

Affiliation:

1. CNRS Paris, Paris, France

2. École Polytechnique, IP Paris, Palaiseau, France

Abstract

We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routing problem (CVRP) on trees, for the entire range of the tour capacity. The result extends to the splittable CVRP.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/3575799

Reference26 articles.

1. PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k

2. Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees

3. S. P. Anbuudayasankar, K. Ganesh, and Sanjay Mohapatra. 2016. Models for Practical Routing Problems in Logistics. Springer.

4. A new approximation algorithm for the capacitated vehicle routing problem on a tree;Asano Tetsuo;J. Combin. Optim.,2001

5. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, and Takeshi Tokuyama. 1997. Covering points in the plane by k-tours: Towards a polynomial time approximation scheme for general k. In 29th Annual ACM Symposium on Theory of Computing. 275–283.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A tight $$(1.5+\epsilon )$$-approximation for unsplittable capacitated vehicle routing on trees;Mathematical Programming;2024-05-25

2. Approximation Schemes for Capacity Vehicle Routing Problems: A Survey;2023 2nd International Conference on Computational Modelling, Simulation and Optimization (ICCMSO);2023-06-23

3. A PTAS for Capacitated Vehicle Routing on Trees;ACM Transactions on Algorithms;2023-03-10

4. Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension;ACM Transactions on Algorithms;2023-03-09

5. Airports and Railways with Unsplittable Demand;2023