HYBRID EVOLUTIONNARY APPROACHES AND NEW BENCHMARKS FOR THE 1-PDPTW

Abstract 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 state of the art on the 1-PDPTW and hybrid evolutionary approaches to solve it. It also presents new benchmarks by giving a complexity level for each treated problem, and shows some results for the 1-PDPTW. 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 travelled distance, total waiting time and total tardiness time.

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

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

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

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

[5]  P. Borne,et al.  Improved tabu search in an hybrid evolutionary approach for the pickup and delivery problem with time windows , 2005, Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005..

[6]  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.

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

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

[9]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

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

[11]  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.

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

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

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

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

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

[17]  Chengbin Chu.  Nouvelles approches analytiques et concept de mémoire artificielle pour divers problèmes d'ordonnancement. (New analytic approaches and concept of artificial memory for a number of scheduling problems) , 1990 .

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

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