Improving the approximation ratio for capacitated vehicle routing

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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming 2023-02, Vol.197 (2), p.451-497
Hauptverfasser:	Blauth, Jannis, Traub, Vera, Vygen, Jens
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Calculus of Variations and Optimal Control Optimization Combinatorics Full Length Paper Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Metric space Numerical Analysis Route planning Theoretical Vehicle routing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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 (Math Oper Res 10:527–542, 1985) and Altinkemer and Gavish (Oper Res Lett 6:149–158, 1987).
ISSN:	0025-5610 1436-4646
DOI:	10.1007/s10107-022-01841-4