Approximate dynamic programming for pickup and delivery problem with crowd-shipping

We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This crowd-shipping operation is subject to a high degree of uncertainty due to the stochastic arrival of online orders and crowd-shippers that im...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Transportation research. Part B: methodological Jg. 187; S. 103027
Hauptverfasser:	Mousavi, Kianoush, Bodur, Merve, Cevik, Mucahit, Roorda, Matthew J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.09.2024
Schlagworte:	Approximate dynamic programming Crowd-shipping Last-mile delivery Markov decision process Value function approximation Markov decision process Approximate dynamic programming Last-mile delivery Value function approximation Crowd-shipping
ISSN:	0191-2615
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!