Approche Multicritère pour le Problème de Ramassage et de Livraison avec Fenêtres de Temps à Plusieurs Véhicules

Nowadays, the transport goods problem occupies an important place in the economic life of modern societies. The pickup and delivery problem with time windows (PDPTW) is one of the problems which a large part of the research was interested. In this paper, we present a a brief literature review of the VRP and the PDPTW, propose our multicriteria approach based on genetic algorithms which allows minimize the compromise between the vehicles number, the total tardiness time and the total travel cost. And this, by treating the case where a customer can have multiple suppliers and one supplier can have multiple customers

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

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

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

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

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

[7]  C. Hwang Multiple Objective Decision Making - Methods and Applications: A State-of-the-Art Survey , 1979 .

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

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

[10]  Oladele A. Ogunseitan,et al.  in Transportation Science , 2009 .

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

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

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