Solving the Real Time Dynamic Pickup and Delivery Problem with Time Windows with Hybrid Evolutionary Approach

In the single-vehicle pickup and delivery problem with time windows (1-PDPTW), a vehicle must serve a collection of transportation requests by taking loads from providers to customers satisfying precedence, capacity and time constraints. In the dynamic case of this problem, after beginning the circuit some requests appear and need to be satisfied. In this paper, we present a brief scientific literature review on the 1-PDPTW and we propose an evolutionary approach to solve this problem. Our evolutionary approach uses an evolutionary algorithm, with special genetic operators to minimize computing time and Pareto dominance method to provide a set of satisfying and feasible solutions to the 1-PDPTW, minimizing the compromise between total travel distance, total waiting time and total tardiness time

[1]  H. Psaraftis.  An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[2]  Yazid Mati,et al.  A tabu search heuristic for the single vehicle pickup and delivery problem with time windows , 2001, J. Intell. Manuf..

[3]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..

[4]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[5]  Mekki Ksouri,et al.  A new hybrid evolutionary approach for the pickup and delivery problem with time windows , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[6]  Mekki Ksouri,et al.  Lower Bounds In An Hybrid Evolutionary Approach For The Pickup And Delivery Problem With Time Windows , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.

[7]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[8]  Jan Karel Lenstra,et al.  Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows , 1993, Transp. Sci..

[9]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing , 1985, Transp. Sci..

[10]  Harilaos N. Psaraftis.  Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem , 1983 .