Abstract
In the following, we rigorously model the presented routing application. To describe dynamic decision making, we use a Markov decision process. We then give an overview on the regarding literature. We focus on the approaches’ spatial and temporal anticipation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Ulmer, M.W. (2017). SDVRP with Stochastic Requests. In: Approximate Dynamic Programming for Dynamic Vehicle Routing. Operations Research/Computer Science Interfaces Series, vol 61. Springer, Cham. https://doi.org/10.1007/978-3-319-55511-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-55511-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55510-2
Online ISBN: 978-3-319-55511-9
eBook Packages: Business and ManagementBusiness and Management (R0)