R. Bellman, Dynamic Programming Treatment of the Travelling Salesman Problem, Journal of the ACM, vol.9, issue.1, pp.61-63, 1962.
DOI : 10.1145/321105.321111

R. Bent and P. 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, 2003.
DOI : 10.1016/j.cor.2004.08.001

C. Blum, J. Puchinger, G. Raidl, and A. Roli, Hybrid metaheuristics in combinatorial optimization: A survey, Applied Soft Computing, vol.11, issue.6, pp.4135-4151, 2011.
DOI : 10.1016/j.asoc.2011.02.032

URL : https://hal.archives-ouvertes.fr/hal-01224683

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, issue.6, pp.579-594, 2003.
DOI : 10.1016/S0191-2615(02)00045-0

J. Cordeau and G. Laporte, The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.174, issue.1, pp.29-46, 2007.
DOI : 10.1007/s10479-007-0170-8

Y. Dumas, J. Desrosiers, E. Gelinas, and M. Solomon, An Optimal Algorithm for the Traveling Salesman Problem with Time Windows, Operations Research, vol.43, issue.2, pp.367-371, 1995.
DOI : 10.1287/opre.43.2.367

B. Funke, T. Grünert, and S. Irnich, Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration, Journal of Heuristics, vol.50, issue.(5), pp.267-306, 2005.
DOI : 10.1007/s10732-005-1997-2

M. Gendreau, J. Potvin, O. Brumlaysy, G. Hasle, and A. Løkketangen, Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography (eds) The Vehicle Routing Problem: Latest Advances and New Challenges, Operations ResearchComputer Science Interfaces Series, vol.43, pp.143-169, 2008.

J. Gromicho, J. Van-hoorn, A. Kok, and J. Schutten, Restricted dynamic programming: A flexible framework for solving realistic VRPs, Computers & Operations Research, vol.39, issue.5, pp.902-909, 2012.
DOI : 10.1016/j.cor.2011.07.002

M. Held and R. Karp, A dynamic programming approach to sequencing problems, Proceedings of the 1961 16th ACM national meeting, pp.61-71, 1961.

C. Malandraki and R. Dial, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, European Journal of Operational Research, vol.90, issue.1, pp.45-55, 1996.
DOI : 10.1016/0377-2217(94)00299-1

P. Norvig, Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp V (2013) Hybrid column generation and large neighborhood search for the dial-a-ride problem, Computers & Operations Research, vol.40, issue.1, pp.490-497, 1992.

S. Parragh, K. Doerner, and R. Hartl, A survey on pickup and delivery problems, Journal f??r Betriebswirtschaft, vol.1667, issue.2, pp.81-117, 2008.
DOI : 10.1007/s11301-008-0036-4

S. Parragh, K. Doerner, R. Hartl, J. Cochran, L. Cox et al., Demand Responsive Transportation, 2010.
DOI : 10.1002/9780470400531.eorms0243

S. Parragh, K. Doerner, and R. Hartl, Variable neighborhood search for the dial-a-ride problem, Computers & Operations Research, vol.37, issue.6, pp.1129-1138, 2010.
DOI : 10.1016/j.cor.2009.10.003

D. Pisinger and S. Ropke, Large Neighborhood Search, Metaheuristics, International Series in Operations Research & Management Science, vol.146, pp.399-419, 2010.
DOI : 10.1007/978-1-4419-1665-5_13

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

H. 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

U. Ritzinger and J. Puchinger, Hybrid Metaheuristics for Dynamic and Stochastic Vehicle Routing, Talbi (2013), pp.77-95, 2013.
DOI : 10.1007/978-3-642-30671-6_2

URL : https://hal.archives-ouvertes.fr/hal-01224923

S. Ropke and D. Pisinger, An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.40, issue.4, pp.455-472, 2006.
DOI : 10.1287/trsc.1050.0135

S. Ropke, J. Cordeau, and G. Laporte, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, vol.46, issue.4, pp.258-272, 2007.
DOI : 10.1002/net.20177

M. Schilde, K. Doerner, and R. Hartl, Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports, Computers & Operations Research, vol.38, issue.12, pp.1719-1730, 2011.
DOI : 10.1016/j.cor.2011.02.006

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Principles and Practice of Constraint Programming CP98, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30

E. Talbi, Hybrid Metaheuristics The vehicle routing problem, Studies in Computational Intelligence, 2001.