Development and Evaluation of two Dynamic Planning Procedures

  • Steffen Schorpp


In this chapter two dynamic planning approaches are developed: an Insertion based procedure with Multiple Neighborhood Search (Section 4.1) and an Assignment based procedure (Section 4.2). Both procedures are directed - as an intermediate step on the way to the actual real-life planning situation - to the local area capacitated MLPDPTW, for which a detailed problem specification has been given in Section 2.3. In Section 4.3 the procedures’ specific characteristics are compared, elaborating the main differences. Afterwards, some test data sets - self-generated as well as taken from the literature - are introduced (Section 4.4). These data sets are used for a comparison of the procedures’ performance and also to gain some general insights to dynamic problems (Section 4.5). Finally, one procedure is chosen for adaptation to the actual real-life scenario (Section 4.6).


Travel Time Delivery Location Anticipation Horizon Arrival Intensity Vehicle Capacity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Gabler Verlag | Springer Fachmedien Wiesbaden GmbH 2011

Authors and Affiliations

  • Steffen Schorpp

There are no affiliations available

Personalised recommendations