Polynomial-Time Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows

The capacitated vehicle routing problem with time windows (CVRPTW) is a well-known NP-hard combinatorial optimization problem. We present a further development of the approach first proposed by M. Haimovich and A. H. G. Rinnooy Kan and propose an algorithm that, for an arbitrary ε > 0, finds a (1...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings of the Steklov Institute of Mathematics Jg. 307; H. Suppl 1; S. 51 - 63
Hauptverfasser:	Khachai, M. Yu, Ogorodnikov, Yu. Yu
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.12.2019 Springer Nature B.V
Schlagworte:	Algorithms Approximation Combinatorial analysis Mathematical analysis Mathematics Mathematics and Statistics Optimization Polynomials Queuing theory Route planning Traveling salesman problem Upper bounds Vehicle routing Windows (intervals) efficient polynomial-time approximation scheme time windows capacitated vehicle routing problem
ISSN:	0081-5438, 1531-8605
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!