]. R. Masson, F. Lehuédé, and O. Péton, Percentage of failure of the necessary conditions and sufficient conditions In the worst case, the DARP relaxation (NC2) has a failure rate of 2.6%, while the PDPT relaxation References References A tabu search algorithm for the dial-a-ride problem with transfers, Proceedings of the International Conference on Industrial Engineering and Systems Management, pp.1224-1232, 2011.

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

G. Berbeglia, J. Cordeau, and G. Laporte, Dynamic pickup and delivery problems, European Journal of Operational Research, vol.202, issue.1, pp.8-15, 2010.
DOI : 10.1016/j.ejor.2009.04.024

J. Paquette, J. Cordeau, and G. Laporte, Quality of service in dial-a-ride operations, Computers & Industrial Engineering, vol.56, issue.4, pp.1721-1734, 2008.
DOI : 10.1016/j.cie.2008.07.005

R. Masson, F. Lehuédé, and O. Péton, An adaptive large neighborhood search for the pickup and delivery problem with transfers, Transportation Science, articles in advance

R. Masson, F. Lehuédé, and O. Péton, Simple Temporal Problems in Route Scheduling for the Dial???a???Ride Problem with Transfers, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimization Problems -9th International Conference, pp.275-291, 2012.
DOI : 10.1007/978-3-642-29828-8_18
URL : https://hal.archives-ouvertes.fr/hal-00725239

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

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. Jain and P. Van-hentenryck, Large Neighborhood Search for Dial-a-Ride Problems, Principles and Practice of Constraint Programming ? CP 2011, pp.400-413, 2011.
DOI : 10.1007/978-3-642-23786-7_31

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

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

D. Stein, Scheduling Dial-a-Ride Transportation Systems, Transportation Science, vol.12, issue.3, pp.232-249, 1978.
DOI : 10.1287/trsc.12.3.232

J. S. Shang and C. K. , Multicriteria pickup and delivery problem with transfer opportunity, Computers & Industrial Engineering, vol.30, issue.4, pp.631-645, 1996.
DOI : 10.1016/0360-8352(95)00181-6

S. Thangiah, A. Fergany, and S. Awam, Real-time split-delivery pickup and delivery time window problems with transfers, Central European Journal of Operations Research, vol.35, issue.4, pp.329-349, 2007.
DOI : 10.1007/s10100-007-0035-x

C. E. Cortés and R. Jayakrishnan, Design and Operational Concepts of High-Coverage Point-to-Point Transit System, Transportation Research Record: Journal of the Transportation Research Board, vol.1783, pp.178-187, 2002.
DOI : 10.3141/1783-22

C. Mues and S. , Transshipment and Time Windows in Vehicle Routing, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), pp.113-119, 2005.
DOI : 10.1109/ISPAN.2005.88

S. Mitrovi´cmitrovi´c-mini´cmini´c and G. Laporte, The pickup and delivery problem with time windows and transshipment, INFOR, vol.44, issue.3, pp.217-228, 2006.

I. L. Gørtz, V. Nagarajan, and R. Ravi, Minimum makespan multi-vehicle dial-a-ride, Proceedings of the 17th ESA, pp.540-552, 2009.

H. L. Petersen and S. Ropke, The Pickup and Delivery Problem with Cross-Docking Opportunity, Proceedings of the Second international conference on Computational logistics, pp.101-113, 2011.
DOI : 10.1007/978-3-642-24264-9_8

Y. Qu and J. F. Bard, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, Computers & Operations Research, vol.39, issue.10, pp.2439-2456, 2012.
DOI : 10.1016/j.cor.2011.11.016

C. E. Cortés, M. Matamala, and C. Contardo, The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method, European Journal of Operational Research, vol.200, issue.3, pp.711-724, 2010.
DOI : 10.1016/j.ejor.2009.01.022

H. L. Kerivin, M. Lacroix, A. R. Mahjoub, and A. Quilliot, The splittable pickup and delivery problem with reloads, European J. of Industrial Engineering, vol.2, issue.2, pp.112-133, 2008.
DOI : 10.1504/EJIE.2008.017347

A. Fugenschuh, Solving a school bus scheduling problem with integer programming, European Journal of Operational Research, vol.193, issue.3, pp.867-884, 2009.
DOI : 10.1016/j.ejor.2007.10.055

Y. Nakao and H. Nagamochi, Worst Case Analysis for Pickup and Delivery Problems with Transfer, Communications and Computer Sciences E91-A (9), pp.2328-2334, 2010.
DOI : 10.1093/ietfec/e91-a.9.2328

R. Masson, S. Ropke, F. Lehuédé, and O. Péton, A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes, European Journal of Operational Research, vol.236, issue.3
DOI : 10.1016/j.ejor.2013.08.042
URL : https://hal.archives-ouvertes.fr/hal-00859068

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

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

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

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

J. Potvin and J. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, European Journal of Operational Research, vol.66, issue.3, pp.331-340, 1993.
DOI : 10.1016/0377-2217(93)90221-8

R. Dechter, I. Meiri, and J. Pearl, Temporal constraint networks, Temporal constraint networks, pp.61-95, 1991.
DOI : 10.1016/0004-3702(91)90006-6

R. Shostak, Deciding Linear Inequalities by Computing Loop Residues, Journal of the ACM, vol.28, issue.4, pp.769-779, 1981.
DOI : 10.1145/322276.322288

B. V. Cherkassky, L. Georgiadis, A. V. Goldberg, R. E. Tarjan, and R. F. Werneck, Shortest-path feasibility algorithms, Journal of Experimental Algorithmics, vol.14, pp.2-7, 2009.
DOI : 10.1145/1498698.1537602

R. E. Tarjan, 7. Shortest Paths, Tech. rep, 1981.
DOI : 10.1137/1.9781611970265.ch7
URL : https://hal.archives-ouvertes.fr/in2p3-01203487

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