Advertisement
Published in:
2017 | OriginalPaper | Chapter
8. Motivation
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 the second part of the book, we describe the process of modeling and the derivation of anticipatory solution approaches for a specific SDVRP. The main reason for replanning is given by uncertain customer requests. Therefore, we consider a dynamic vehicle routing problem with stochastic customer requests. After a short motivation, we show how the problem is modeled, present a variety of solution methods with different degree of anticipation, and compare these methods in an extensive computational study.