Improving the Approximation Ratio for Capacitated Vehicle Routing
Data Structures and Algorithms
2020-11-11 v1 Discrete Mathematics
Abstract
We devise a new approximation algorithm for capacitated vehicle routing. Our algorithm yields a better approximation ratio for general capacitated vehicle routing as well as for the unit-demand case and the splittable variant. Our results hold in arbitrary metric spaces. This is the first improvement upon the classical tour partitioning algorithm by Haimovich and Rinnooy Kan and Altinkemer and Gavish.
Keywords
Cite
@article{arxiv.2011.05235,
title = {Improving the Approximation Ratio for Capacitated Vehicle Routing},
author = {Jannis Blauth and Vera Traub and Jens Vygen},
journal= {arXiv preprint arXiv:2011.05235},
year = {2020}
}