[. A. Références-bibliographiques and . Colorni, Distributed optimization by ant coloniess, Proceeding of the first European Conference on Artificial Life (ECAL 91), pp.134-142, 1992.

[. A. Lebouthilier, LeBouthilier Modélisation UML pour une architecture coopérative appliquée au problème de tournées de véhicules avec fenêtres de temps Département d'informatique et de recherche opérationnelle. Faculté des arts et des sciences, Canada, 2000.

R. Bent, P. Van-hentenryck, R. Bent, and P. Van-hentenryck, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Computers & Operations Research, vol.33, issue.4, pp.875-893, 2006.
DOI : 10.1016/j.cor.2004.08.001

. D. Bertsimas and . Van-ryzin, A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane, Operations Research, vol.39, issue.4, pp.601-615, 1991.
DOI : 10.1287/opre.39.4.601

. Billaut, Ordonnancement d'ateliers à ressources multiples. Chapitre dans l'ouvrage : Ordonnancement de la production, 2001.

. Bodin, Routing and Scheduling of School Buses by Computer, Transportation Science, vol.13, issue.2, pp.113-129, 1979.
DOI : 10.1287/trsc.13.2.113

J. Carlier, An Algorithm for Solving the Job-Shop Problem, Management Science, vol.35, issue.2, pp.164-176, 1989.
DOI : 10.1287/mnsc.35.2.164

N. Christofides, The vehicle routing problem, Revue fran??aise d'automatique, informatique, recherche op??rationnelle. Recherche op??rationnelle, vol.10, issue.V1, pp.315-338, 1979.
DOI : 10.1051/ro/197610V100551

.. Cordeau, J. Laporte, . Cordeau, and G. Laporte, The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol.1, issue.2, pp.89-101, 2003.
DOI : 10.1007/s10288-002-0009-8

. Dantzig, The Truck Dispatching Problem, Management Science, vol.6, issue.1, pp.80-91, 1959.
DOI : 10.1287/mnsc.6.1.80

. Berkoune, Lower Bounds For The Scheduling Problem With Uncertain Demands, Int. J, 2006.

. Desrosiers, A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows, American Journal of Mathematical and Management Sciences, vol.10, issue.4, pp.301-325, 1986.
DOI : 10.1080/01966324.1986.10737198

D. Et-dessouky, M. Dessouky, and M. M. , A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows, Transportation Research B, vol.38, pp.539-557, 2004.

[. Glover, Future paths fur integer programming and links to artificial intelligence, Computers & Operations Research, vol.5, pp.533-549, 1986.
DOI : 10.1016/0305-0548(86)90048-1

[. Glover, Tabu Search???Part I, ORSA Journal on Computing, vol.1, issue.3, pp.190-206, 1989.
DOI : 10.1287/ijoc.1.3.190

[. Glover, Tabu Search???Part II, ORSA Journal on Computing, vol.2, issue.1, pp.4-32, 1990.
DOI : 10.1287/ijoc.2.1.4

M. L. Fisher-et-jaikumar, R. Fisher, and . Jaikumar, A generalized assignment heuristic for vehicle routing, Networks, vol.21, issue.2, pp.109-124, 1981.
DOI : 10.1002/net.3230110205

[. F. Malca1 and F. Semet, A Tabu Search Heuristic for the Pickup and Delivery Problem with Time Windows and a Fixed Size Fleet, Malca1 et F. Semet, pp.59313-59322, 2003.

T. Garaix, Point-to-point on-demand transport in rural areas. A route optimisation method, Cybergeo, 2005.
DOI : 10.4000/cybergeo.11373

C. , J. W. Wright, G. Clarke, and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, vol.12, pp.568-581, 1964.

M. Gerla and M. Gerla, The Design of Store-and-forward Networks for Computer Communications, 1973.

. L. Gilbert and . Frédéric, Classical Heuristics for the Vehicle Routing Problem, 1998.

. Goel and . Et-gruhn, Asvin Goel et Volker Gruhn Large Neighborhood Search for rich VRP with multiple pickup and delivery locations, MEC- VNS: 18th Mini Euro Conference on VNS, 2005.

. Goldberg, The fleet size and mix vehicle routing problem, Management Science and Statistics. Working paper, pp.82-102, 1982.

. Goldberg and D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1989.

. N. Hayari, Un algorithme évolutionniste pour le problème de tournées sélectives avec contraintes de fenêtres de temps, 2003.

[. H. Psaraftis and H. N. Psaraftis, A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem, Transportation Science, vol.14, issue.2, pp.130-154, 1980.
DOI : 10.1287/trsc.14.2.130

. J. Holland, J. Holland, and . Holland, Outline for a Logical Theory of Adaptive Systems, Journal of the ACM, vol.9, issue.3, 1962.
DOI : 10.1145/321127.321128

M. Hwang, C. Hwang, and A. Masud, Multiple objective decision making -methods and applications, Lectures Notes in Economics and Mathematical Systems, 1979.
DOI : 10.1007/978-3-642-45511-7

H. Dridi, Un Algorithme génétique pour le problème de ramassage et de livraison avec fenêtres de temps à plusieurs véhicules, Septembre 2008 Proc. Article 176, 2008.

[. Dridi, Un Algorithme génétique pour l'optimisation du problème de ramassage et de livraison avec fenêtres de temps à plusieurs véhicules, Automatique Avancée et Informatique Appliquée, pp.143-148, 2009.

[. Dridi, A Genetic Algorithm for the Multi-Pickup and Delivery Problem with time windows, Studies in Informatics and Control (SIC), pp.2-173, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00521138

H. Dridi, Genetic Algorithm for Multicriteria Optimization of a Multi- Pickup and Delivery Problem with Time Windows. 13 th INCOM IFAC symposium, pp.1521-1526, 2009.

[. Dridi, Approche multicritère pour le problème de ramassage et de livraison avec fenêtres de temps à plusieurs véhicules, 2009.

[. Dridi, Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00556216

[. I. Kacem, Ordonnancement multicritères des job shops flexibles : formulation, bornes inferieures et approche évolutionniste coopérative, Thèse en Automatique et informatique industrielle à l'université de Lille 1, 2003.

J. Odini, A. Psaraftis, H. , W. , and N. , A heuristic algorithm for the multiple-vehicle advance-request dial-a-ride problem with time windows, Transportation Research, vol.20, pp.243-257, 1986.

. X. Jian, Un algorithme génétique pour le problème de tournées de véhicules avec des demandes stochastiques et fenêtres de temps, 2007.

[. J. Holand and J. Holland, Adaptation in natural and artificial systems, 1975.

W. Jih, Dynamic vehicle routing using hybrid genetic algorithms, International Conference on Robotics and Automation, pp.453-458, 1999.

J. , H. Jung, S. Haghani, and A. , Genetic algorithm for a pick-up and delivery problem with time windows, Transportation Research Record, p.1733, 2000.

B. Jurich, Scheduling Jobs in Shops with Multi-purpose Machines, 1992.

R. Kammarti, A new hybrid evolutionary approach for the pickup and delivery problem with time windows, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), pp.1498-1503, 2004.
DOI : 10.1109/ICSMC.2004.1399843

R. Kammarti, Lower Bounds In An Hybrid Evolutionary Approach For The Pickup And Delivery Problem With Time Windows, 2005 IEEE International Conference on Systems, Man and Cybernetics, pp.1156-1161, 2005.
DOI : 10.1109/ICSMC.2005.1571302

R. Kammarti, Solving the Real Time Dynamic Pickup and Delivery Problem with Time Windows with Hybrid Evolutionary Approach, IEEE International Conference on Systems, Man and Cybernetics, 2006.

R. Kammarti, Approche évolutionniste pour la résolution du 1- PDPTW statique et dynamique, Thèse en Automatique et Informatique Industrielle à l'université des sciences et de technologie de Lille, 2006.

. Karsten, Vehicle Routing Problems with Varying Degrees of Dynamism, 1996.

[. K. Ghedira, Khaled Ghedira. Optimisation combinatoire par métaheuristiques, Edition TECHNIP, 2007.

L. Lao, H. C. Lao, and Z. Liang, PICKUP AND DELIVERY WITH TIME WINDOWS: ALGORITHMS AND TEST CASE GENERATION, International Journal on Artificial Intelligence Tools, vol.11, issue.03, pp.455-472, 2002.
DOI : 10.1142/S0218213002000988

G. G. Laporte and . Laporte, The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research, vol.59, issue.3, pp.345-358, 1992.
DOI : 10.1016/0377-2217(92)90192-C

A. Larsen, The Dynamic Vehicle Routing Problem, 2001.

J. Lenstra, Complexity of vehicle routing and scheduling problems, Networks, vol.12, issue.2, pp.221-228, 1981.
DOI : 10.1002/net.3230110211

H. Li, . A. Lim, A. Li, and . Lim, A metaheuristic for the pickup and delivery problem with time windows, IEEE International Conference on Tools with Artificial Intelligence, pp.160-167, 2001.

H. Li, Solving the pickup and delivery problem with time windows using squeaky wheel " optimization with local search, SMU Business Conference Paper Series, 2002.

. Lin, W. Et-brian, W. Kernighan-shen-lin-et-brian, and . Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Operations Research, vol.21, issue.2, pp.498-516, 1973.
DOI : 10.1287/opre.21.2.498

S. Mitrovic-minic, Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows, Transportation Research Part B: Methodological, vol.38, issue.8, pp.669-685, 2004.
DOI : 10.1016/j.trb.2003.09.001

R. Montamenni, A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System, 2002.

M. Nabaa, Approche décentralisée pour résoudre le problème du transport à la demande. Schedae, prépublication n° 23, pp.133-140, 2007.

[. N. Psaraftis, Psaraftis Vehicle Routing: Methods and Studies, chapter Dynamic Vehicle Routing Problems, pp.223-248, 1988.

. Paolo and . Et-daniele, Paolo Toth et Daniele Vigo, éditeurs. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, 2002.

. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming. présenté au " Congress on Numerical Methods in Combinatorial Optimization, 1986.

[. P. Wesolek, Wesolek. Fuzzy value for imprecision and flexible constraints in vehicle routing problems, pp.60-965, 2005.

L. Quan, A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows, Science direct European Journal of Operational Research, 2003.

C. Rego, Rego et C. Roucairol. Le problème de tournées de véhicules : Etude et Résolution Approchée, 1994.

. Ropke, J. Et-cordeau, . Ropke, and J. Et-cordeau, Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.43, issue.3, pp.33-2008, 2008.
DOI : 10.1287/trsc.1090.0272

M. W. Savelsbergh, Local search in routing problems with time windows, Annals of Operations Research, vol.1, issue.1, pp.285-305, 1995.
DOI : 10.1007/BF02022044

. M. Savelsbergh, The General Pickup and Delivery Problem, Transportation Science, vol.29, issue.1, 1995.
DOI : 10.1287/trsc.29.1.17

[. S. Kirkpatrick, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

. P. Shaw and P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, CP-98 (Fourth International Conference on Principles and Practice of Constraint Programming), pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7295

. Slater and A. Slater, Specification for a dynamic vehicle routing and scheduling system, International Journal of Transport Management, vol.1, issue.1, pp.29-40, 2002.
DOI : 10.1016/S1471-4051(01)00004-0

. Sol, A branch-and-price algorithm for the pickup and delivery problem with time windows. Memorandum COSOR 94-22, 1994.

. B. Tolga and B. Tolga, The multiple traveling salesman problem: an overview of formulations and solution procedures, Omega The International journal of Management Science, vol.34, pp.209-219, 2006.

. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications, vol.21, issue.1, pp.41-51, 1985.
DOI : 10.1007/BF00940812

N. Velasco, Un algorithme génétique pour un problème de collecte bi-objectif, 2006.

[. V. Vacic, Vehicle Routing Problem with Time Windows, 2002.

[. Y. Dumas, «Large scale multi-vehicle dial-a-ride systems», des Hautes Etudes de Commerciales, pp.89-119, 1989.