N. Azi, M. Gendreau, and J. Potvin, An exact algorithm for a single-vehicle routing problem with time windows and multiple routes, European Journal of Operational Research, vol.178, issue.3, pp.755-766, 2007.
DOI : 10.1016/j.ejor.2006.02.019

M. Battarra, M. Monaci, and D. Vigo, An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem, Computers & Operations Research, vol.36, issue.11, pp.3041-3050, 2009.
DOI : 10.1016/j.cor.2009.02.008

J. B?a?ewicz, K. Ecker, E. Pesch, G. Schmidt, and J. W¸eglarzw¸eglarz, Handbook on Scheduling -From Theory to Application, chapter Scheduling on One Processor, 2007.

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms, Transportation Science, vol.39, issue.1, pp.104-118, 2005.
DOI : 10.1287/trsc.1030.0056

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part II: Metaheuristics, Transportation Science, vol.39, issue.1, pp.119-139, 2005.
DOI : 10.1287/trsc.1030.0057

D. Cattaruzza, N. Absi, D. Feillet, and T. Vidal, A memetic algorithm for the Multi Trip Vehicle Routing Problem, European Journal of Operational Research, vol.236, issue.3, 2013.
DOI : 10.1016/j.ejor.2013.06.012
URL : https://hal.archives-ouvertes.fr/emse-00847561

T. G. Crainic, City Logistics Tutorials in Operations Research 2008 -State-of-the-Art Decision Making Tools in the Information-Intensive Age, INFORMS, pp.181-212, 2008.

N. Hansen and A. Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, pp.159-195, 2001.
DOI : 10.1016/0004-3702(95)00124-7

V. C. Hemmelmayr, J. F. Cordeau, and T. G. Crainic, An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics, Computers & Operations Research, vol.39, issue.12, pp.3215-3228, 2012.
DOI : 10.1016/j.cor.2012.04.007

F. Hernandez, D. Feillet, R. Giroudeau, and O. Naud, An exact algorithm to solve the multi-trip vehicle routing problem with time windows, 2013.

F. Hernandez, D. Feillet, R. Giroudeau, and O. Naud, A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR, 10, 1007.
URL : https://hal.archives-ouvertes.fr/lirmm-01056150

J. Holland, Adaptation in Natural and Artificial Systems, 1975.

S. Irnich, A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics, INFORMS Journal on Computing, vol.20, issue.2, pp.270-287, 2008.
DOI : 10.1287/ijoc.1070.0239

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

A. Larsen, O. B. Madsen, and M. M. Solomon, Recent Developments in Dynamic Vehicle Routing Systems, The Vehicle Routing Problem: Latest Advances and New Challenges, number 43 in Operations Research Computer Science Interfaces, pp.199-218, 2008.
DOI : 10.1007/978-0-387-77778-8_9

R. Macedo, C. Alves, J. M. Valério-decarvalho, F. Clautiaux, and S. Hanafi, Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model, European Journal of Operational Research, vol.214, issue.3, pp.536-545, 2011.
DOI : 10.1016/j.ejor.2011.04.037
URL : https://hal.archives-ouvertes.fr/hal-00616366

P. Moscato and C. Cotta, A modern introduction to memetic algorithms In Handbook of Metaheuristics -Second Edition, International series in operations research and management science, pp.141-183, 2010.

Y. Nagata, O. Bräysy, and W. Dullaert, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Computers & Operations Research, vol.37, issue.4, pp.724-737, 2010.
DOI : 10.1016/j.cor.2009.06.022

F. Neri and C. Cotta, Memetic algorithms and memetic computing optimization: A literature review. Swarm and Evolutionary Computation, pp.1-14, 2012.

A. Olivera and O. Viera, Adaptive memory programming for the vehicle routing problem with multiple trips, Computers & Operations Research, vol.34, issue.1, pp.28-47, 2007.
DOI : 10.1016/j.cor.2005.02.044

V. Pillac, M. Gendreau, C. Guéret, and A. L. Medaglia, A review of dynamic vehicle routing problems, European Journal of Operational Research, vol.225, issue.1, pp.1-11, 2013.
DOI : 10.1016/j.ejor.2012.08.015
URL : https://hal.archives-ouvertes.fr/hal-00739779

M. L. Pinedo, Planning and Scheduling in Manufacturing and Services, chapter Manufacturing Models, Series in Operations Research, pp.19-36, 2001.

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.
DOI : 10.1016/S0305-0548(03)00158-8

C. Prins, Two memetic algorithms for heterogeneous fleet vehicle routing problems, Engineering Applications of Artificial Intelligence, vol.22, issue.6, pp.916-928, 2009.
DOI : 10.1016/j.engappai.2008.10.006

C. R. Reeves, Genetic algorithms In Handbook of Metaheuristics -Second Edition, International series in operations research and management science, pp.109-140, 2010.

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

M. Schneider, B. Sand, and A. Stenger, A note on the time travel approach for handling time windows in vehicle routing problems, Computers & Operations Research, vol.40, issue.10, 2013.
DOI : 10.1016/j.cor.2013.02.002

M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.
DOI : 10.1287/opre.35.2.254

É. D. Taillard, G. Laporte, and M. Gendreau, Vehicle routeing with multiple use of vehicles, Journal of Operational Research Society, issue.8, pp.471065-1070, 1996.

T. Vidal, T. G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei, A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems, Operations Research, vol.60, issue.3, pp.611-624, 2012.
DOI : 10.1287/opre.1120.1048

T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Computers & Operations Research, vol.40, issue.1, pp.475-489, 2013.
DOI : 10.1016/j.cor.2012.07.018