Abstract
In this chapter, we define the approaches for the SDVRP. We present an approach for (nearly) every class of anticipation. We treat the non-reactive approaches as benchmarks and focus on the reactive approaches. We show the required steps to achieve reactive anticipation for the given problem and depict the advantages and disadvantages of offline and online 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). Solution Algorithms. 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_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-55511-9_10
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)