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

Full description

Saved in:

Bibliographic Details
Published in:	Central European journal of operations research Vol. 28; no. 1; pp. 279 - 308
Main Author:	Ulmer, Marlin W.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020 Springer Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!