Advertisement
Published in:
2017 | OriginalPaper | Chapter
10. Solution Algorithms
Author : Marlin Wolf Ulmer
Published in: Approximate Dynamic Programming for Dynamic Vehicle Routing
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.