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...
Gespeichert in:
| Veröffentlicht in: | Proceedings of the Steklov Institute of Mathematics Jg. 307; H. Suppl 1; S. 51 - 63 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
Moscow
Pleiades Publishing
01.12.2019
Springer Nature B.V |
| Schlagworte: | |
| ISSN: | 0081-5438, 1531-8605 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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 +
ε
)-approximate solution for the Euclidean CVRPTW in
, where
q
is an upper bound for the capacities of the vehicles,
p
is the number of time windows, and TIME(TSP,
ρ
,
n
) is the complexity of finding a
ρ
-approximation solution of an auxiliary instance of the Euclidean TSP. Thus, the algorithm is a polynomial-time approximation scheme for the CVRPTW with
p
3
q
4
=
O
(log
n
) and an efficient polynomial-time approximation scheme for arbitrary fixed values of
p
and
q
. |
|---|---|
| Bibliographie: | ObjectType-Article-1 ObjectType-Feature-2 SourceType-Conference Papers & Proceedings-1 content type line 22 |
| ISSN: | 0081-5438 1531-8605 |
| DOI: | 10.1134/S0081543819070058 |