C. Archetti and M. G. Speranza, A survey on matheuristics for routing problems, EURO Journal on Computational Optimization, vol.189, issue.3, pp.223-246, 2014.
DOI : 10.1016/j.ejor.2007.02.061

K. Braekers, A. Caris, and G. K. Janssens, Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots, Transportation Research Part B: Methodological, vol.67, pp.166-186, 2014.
DOI : 10.1016/j.trb.2014.05.007

M. Chassaing, C. Duhamel, and P. Lacomme, An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem, Engineering Applications of Artificial Intelligence, vol.48, pp.119-133, 2016.
DOI : 10.1016/j.engappai.2015.10.002

J. Christiaens and G. Vanden-berghe, A fresh ruin & recreate implementation for the capacitated vehicle routing problem, 2016.

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

U. Derigs, J. Gottlieb, J. Kalkoff, M. Piesche, F. Rothlauf et al., Vehicle routing with compartments: applications, modelling and heuristics, OR Spectrum, vol.3, issue.2, pp.885-914, 2011.
DOI : 10.1023/B:JMMA.0000036583.17284.02

K. F. Doerner and J. Salazar-gonzàlez, Pickup-and-delivery problems for people transportation, Vehicle Routing: Problems, Methods, and Applications, pp.193-212, 2014.

G. Dueck, New Optimization Heuristics, Journal of Computational Physics, vol.104, issue.1, pp.86-92, 1993.
DOI : 10.1006/jcph.1993.1010

M. Firat and G. J. Woeginger, Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh, Operations Research Letters, vol.39, issue.1, pp.32-35, 2011.
DOI : 10.1016/j.orl.2010.11.004

B. A. Foster and D. M. Ryan, An Integer Programming Approach to the Vehicle Scheduling Problem, Journal of the Operational Research Society, vol.27, issue.2, pp.367-384, 1976.
DOI : 10.1057/jors.1976.63

B. Golden, A. Assad, L. Levy, and F. Gheysens, The fleet size and mix vehicle routing problem, Computers & Operations Research, vol.11, issue.1, pp.49-66, 1984.
DOI : 10.1016/0305-0548(84)90007-8

P. Grangier, M. Gendreau, F. Lehuédé, and L. Rousseau, A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking, Computers & Operations Research, vol.84, pp.116-126, 2017.
DOI : 10.1016/j.cor.2017.03.004
URL : https://hal.archives-ouvertes.fr/hal-01499170

T. Gschwind and M. Drexl, Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem. LM-2016-08, 2016.

T. Gschwind, Route Feasibility Testing and Forward Time Slack for the Synchronized Pickup and Delivery Problem, Gutenberg School of Management and Economics, 2015.

T. Henke, M. G. Speranza, and G. Wäscher, The multi-compartment vehicle routing problem with flexible compartment sizes, European Journal of Operational Research, vol.246, issue.3, pp.730-743, 2015.
DOI : 10.1016/j.ejor.2015.05.020

B. Hunsaker and M. Savelsbergh, Efficient feasibility testing for dial-a-ride problems, Operations Research Letters, vol.30, issue.3, pp.169-173, 2002.
DOI : 10.1016/S0167-6377(02)00120-7

C. Koç, T. Bektas, O. Jabali, and G. Laporte, Thirty years of heterogeneous vehicle routing, European Journal of Operational Research, vol.249, issue.1, pp.1-21, 2016.
DOI : 10.1016/j.ejor.2015.07.020

H. Koch, T. Henke, and G. Wäscher, A genetic algorithm for the multicompartment vehicle routing problem with flexible compartment sizes, 2016.

D. Luxen and C. Vetter, Real-time routing with OpenStreetMap data, Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS '11, pp.513-516, 2011.
DOI : 10.1145/2093973.2094062

R. Masson, F. Lehuédé, and O. Péton, The Dial-A-Ride Problem with Transfers, Computers & Operations Research, vol.41, pp.12-23, 2014.
DOI : 10.1016/j.cor.2013.07.020
URL : https://hal.archives-ouvertes.fr/hal-00818800

S. N. Parragh, Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem, Transportation Research Part C: Emerging Technologies, vol.19, issue.5, pp.912-930, 2011.
DOI : 10.1016/j.trc.2010.06.002

S. N. Parragh, K. F. Doerner, and R. F. Hartl, A survey on pickup and delivery problems, Journal f??r Betriebswirtschaft, vol.1667, issue.2, pp.81-117, 2008.
DOI : 10.1002/(SICI)1520-6440(199907)82:7<30::AID-ECJC4>3.0.CO;2-2

S. N. Parragh, K. F. Doerner, and R. F. 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

S. N. Parragh and V. Schmid, Hybrid column generation and large neighborhood search for the dial-a-ride problem, Computers & Operations Research, vol.40, issue.1, pp.490-497, 2013.
DOI : 10.1016/j.cor.2012.08.004

D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Computers & Operations Research, vol.34, issue.8, pp.2403-2435, 2007.
DOI : 10.1016/j.cor.2005.09.012

Y. Qu and J. F. Bard, The heterogeneous pickup and delivery problem with configurable vehicle capacity, Transportation Research Part C: Emerging Technologies, vol.32, pp.1-20, 2013.
DOI : 10.1016/j.trc.2013.03.007

Y. Qu and J. F. Bard, A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity, Transportation Science, vol.49, issue.2, pp.254-270, 2015.
DOI : 10.1287/trsc.2014.0524

Y. Rochat and ´. E. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics, vol.41, issue.1, pp.147-167, 1995.
DOI : 10.1287/ijoc.2.1.4

S. Ropke and J. Cordeau, Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.43, issue.3, pp.267-286, 2009.
DOI : 10.1287/trsc.1090.0272

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.1137/1.9780898718515.ch3

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

G. Schrimpf, J. Schneider, H. Stamm-wilbrandt, and G. Dueck, Record Breaking Optimization Results Using the Ruin and Recreate Principle, Journal of Computational Physics, vol.159, issue.2, pp.139-171, 2000.
DOI : 10.1006/jcph.1999.6413

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

A. Subramanian, E. Uchoa, and L. S. Ochi, A hybrid algorithm for a class of vehicle routing problems, Computers & Operations Research, vol.40, issue.10, pp.2519-2531, 2013.
DOI : 10.1016/j.cor.2013.01.013

E. D. Taillard, A heuristic column generation method for the heterogeneous fleet VRP, RAIRO - Operations Research, vol.33, issue.1, pp.1-14, 1999.
DOI : 10.1051/ro:1999101

J. Tang, Y. Kong, H. Lau, and A. W. Ip, A note on ???Efficient feasibility testing for dial-a-ride problems???, Operations Research Letters, vol.38, issue.5, pp.405-407, 2010.
DOI : 10.1016/j.orl.2010.05.002

P. Toth and D. Vigo, Heuristic Algorithms for the Handicapped Persons Transportation Problem, Transportation Science, vol.31, issue.1, pp.60-71, 1997.
DOI : 10.1287/trsc.31.1.60