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...

Celý popis

Podrobná bibliografia

Vydané v:	Transportation research. Part B: methodological Ročník 187; s. 103027
Hlavní autori:	Mousavi, Kianoush, Bodur, Merve, Cevik, Mucahit, Roorda, Matthew J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.09.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!