Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing

Stochastic and dynamic vehicle routing problems gain increasing attention in the research community. In these problems, routing plans are dynamically updated based on realizations of stochastic information. Due to the complexity of the corresponding Markov decision processes (MDPs), the calculation...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Central European journal of operations research Ročník 28; číslo 1; s. 279 - 308
Hlavný autor:	Ulmer, Marlin W.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020 Springer Springer Nature B.V
Predmet:	Approximation Business and Management Computer simulation Decision-making Dynamic programming Heuristic methods Logistics Management Markov processes Mathematical analysis Motor vehicle fleets Operations research Operations Research/Decision Theory Original Paper Route planning Stochastic models Vehicle routing Germany Dynamic vehicle routing Approximate dynamic programming Value function approximation Rollout algorithm Stochastic requests Multi-period
ISSN:	1435-246X, 1613-9178
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!