Dynamic pick-up and delivery vehicle routing problem with ready-time and deadline

摘要

In this paper, a dynamic delivery and pick-up vehicle routing problem (DVRP) with ready-time and deadline of customer goods is proposed. By using the rolling horizon approach, the DVRP is modeled and analyzed. On each decision epoch, the open vehicle routing problem with multiple depots is modeled. Based on the adaptive memory programming, a master-slave parallel tabu search algorithm is developed, and an insertion procedure is also suggested for the real-time urgent orders. Computational experiment reveals that the parallel tabu search algorithm is of high practical value for solving the dynamic vehicle routing problem.