Improved tabu search in an hybrid evolutionary approach for the pickup and delivery problem with time windows

In this paper we present an improved tabu search in an hybrid evolutionary approach for the single-vehicle pickup and delivery problem with time windows (1-PDPTW). In the 1-PDPTW a vehicle must serve a collection of transportation requests by taking loads from providers to customers satisfying precedence, capacity and time constraints. This paper purposes a brief review the scientific literature of the 1-PDPTW, presents the hybrid evolutionary approach to solve this problem and details the improved tabu search. Our hybrid evolutionary approach use evolutionary algorithm, with special genetic operators, tabu search, construction heuristics, Pareto dominance method to provide a set of satisfying and feasible solutions to the 1-PDPTW minimizing total traveled distance, total waiting time and total tardiness time.

[1]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[2]  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).

[3]  Michel Gendreau,et al.  Tabu Search heuristics for the Vehicle Routing Problem with Time Windows , 2002 .

[4]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[5]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

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

[7]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

[9]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[10]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[12]  Andrew Lim,et al.  A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

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

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

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

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

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