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ženo v:

Podrobná bibliografie
Vydáno 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:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020 Springer Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!