A Genetic Algorithm for the Multi-Pickup and Delivery Problem with time windows

In This paper we present a genetic algorithm for the multi-pickup and delivery problem with time windows (m-PDPTW). The m-PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. This paper purposes a brief literature review of the PDPTW, present our approach based on genetic algorithms to minimizing the total travel distance and thereafter the total travel cost, by showing that an encoding represents the parameters of each individual.

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

[2]  Jane Yung-jen Hsu,et al.  Dynamic vehicle routing using hybrid genetic algorithms , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[3]  P. Borne,et al.  Solving the Real Time Dynamic Pickup and Delivery Problem with Time Windows with Hybrid Evolutionary Approach , 2006, The Proceedings of the Multiconference on "Computational Engineering in Systems Applications".

[4]  Roberto Montemanni,et al.  A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System , 2002 .

[5]  Nubia Velasco,et al.  Un algorithme génétique pour un problème de collectes et livraisons bi-objectif , 2006 .

[6]  Mekki Ksouri,et al.  Un Algorithme génétique pour le problème de ramassage et de livraison avec fenêtres de temps à plusieurs véhicules , 2010, ArXiv.

[7]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[8]  Andrew Lim,et al.  A Metaheuristic for the Pickup and Delivery Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.

[9]  Pierre Borne,et al.  HYBRID EVOLUTIONNARY APPROACHES AND NEW BENCHMARKS FOR THE 1-PDPTW , 2007 .

[10]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[11]  M. Sol.  A branch-and-price algorithm for the pickup and delivery problem with time windows , 2010 .

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

[13]  Constantin Oprean,et al.  Ant Colony Solving Multiple Constraints Problem: Vehicle Route Allocation , 2008, Int. J. Comput. Commun. Control.

[14]  M. Sol.  The general pickup and delivery problem , 2010 .

[15]  Andrew Lim,et al.  SOLVING THE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS USING iSSQUEAKY WHEELli OPTIMIZATION WITH LOCAL SEARCH , 2002 .

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

[17]  Maged M. Dessouky,et al.  A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows , 2006, Eur. J. Oper. Res..

[18]  Mwp Martin Savelsbergh,et al.  A branch-and-price algorithm for the pickup and delivery problem with time windows , 1994 .