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

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the Steklov Institute of Mathematics 2019-12, Vol.307 (Suppl 1), p.51-63
Hauptverfasser:	Khachai, M. Yu, Ogorodnikov, Yu. Yu
Format:	Artikel
Sprache:	eng
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)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!