Preemptive depot returns for dynamic same-day delivery

In this paper, we explore same-day delivery routing and particularly how same-day delivery vehicles can better integrate dynamic requests into delivery routes by taking advantage of preemptive depot returns. A preemptive depot return occurs when a delivery vehicle returns to the depot before deliver...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:EURO Journal on Transportation and Logistics Jg. 8; H. 4; S. 327 - 361
Hauptverfasser: Ulmer, Marlin W., Thomas, Barrett W., Mattfeld, Dirk C.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Elsevier B.V 01.12.2019
Springer Berlin Heidelberg
Elsevier Limited
Schlagworte:
Approximate dynamic programming
Approximation
Business and Management
Dynamic programming
Logistics
Management Science
Mathematical analysis
Operations Research
Operations Research/Decision Theory
Optimization
Packages
Preempting
Preemptive depot returns
Research Paper
Route planning
Same-day delivery
Stochastic dynamic vehicle routing
Stochastic dynamic vehicle routing
Approximate dynamic programming
Preemptive depot returns
Same-day delivery
ISSN:2192-4376, 2192-4384
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we explore same-day delivery routing and particularly how same-day delivery vehicles can better integrate dynamic requests into delivery routes by taking advantage of preemptive depot returns. A preemptive depot return occurs when a delivery vehicle returns to the depot before delivering all of the packages currently on-board the vehicle. In this paper, we assume that a vehicle serves requests in a particular delivery area. Beginning the day with some known deliveries, the vehicle seeks to serve the known requests as well as additional new requests that are received throughout the day. To serve the new requests, the vehicle must return to the depot to pick up the packages for delivery. In contrast to previous work on same-day delivery routing, in this paper, we allow the vehicle to return to the depot before serving all loaded packages. To solve the problem, we couple an approximation of the value of choosing any particular subset of requests for delivery with a routing heuristic. Our approximation procedure is based on approximate dynamic programming and allows us to capture both the current value of a subset selection decision and its impact on future rewards. Using extensive computational tests, we demonstrate the value of preemptive depot returns and the value of the proposed approximation scheme in supporting preemptive returns. We also identify characteristics of instances for which preemptive depot returns are most likely to offer improvement.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2192-4376
2192-4384
DOI:10.1007/s13676-018-0124-0