Some Remarks on the GIST Approach for the Vehicle Routing Problem with Pickup and Delivery and Time Windows (VRPPDTW)

摘要

During the last years there has been extensive research on extensions of the classical Vehicle Routing Problem (VRP) with respect to additional constraints which occur in real-world applications. The family of those "new" and difficult VRP-variants is often referred to as Rich Vehicle Routing Problems (RVRP). In [1] we have presented a rather specific, non-literature standard Pickup and Delivery Vehicle Routing Problem with Time Windows (VRPPDTW) together with an effective heuristic and system called ROUTER. This work was motivated by a system development project. In this work we focus on solving the standard VRPPDTW which is one of the RVRP-challenges discussed in literature.