Title :
Dynamic pick-up and delivery vehicle routing problem with ready-time and deadline
Author :
Quan XiongWen ; Xu Ya
Author_Institution :
Coll. of Inf. Tech. Sci., Nankai Univ., Tianjin, China
Abstract :
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.
Keywords :
customer services; goods distribution; search problems; vehicle routing; DVRP; adaptive memory programming; customer goods; deadline; decision epoch; delivery vehicle routing problem; dynamic pick-up routing problem; master-slave parallel tabu search algorithm; ready-time; Heuristic algorithms; Optimization; Real-time systems; Routing; Search problems; Vehicle dynamics; Vehicles; Dynamic vehicle routing; Parallel algorithm; Rolling horizon; Tabu search;
Conference_Titel :
Control Conference (CCC), 2013 32nd Chinese
Conference_Location :
Xi´an
