R. Baldacci, E. Bartolini, and A. Mingozzi, An Exact Algorithm for the Pickup and Delivery Problem with Time Windows, Operations Research, vol.59, issue.2, pp.414-426, 2011.
DOI : 10.1287/opre.1100.0881

D. Cattaruzza, N. Absi, D. Feillet, O. Guyon, and X. Libeaut, The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates, Proceedings of the 10th Metaheuristics International Conference, pp.1-10, 2013.
DOI : 10.1287/trsc.2015.0608
URL : https://hal.archives-ouvertes.fr/emse-00981809

J. Cordeau, G. Desaulniers, J. Desrosiers, M. Solomon, and F. Soumis, 7. VRP with Time Windows, The Vehicle Routing Problem. Society Industrial and Applied Mathematics, pp.157-193, 2002.
DOI : 10.1137/1.9780898718515.ch7

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

T. Crainic, F. Errico, W. Rei, and N. Ricciardi, Modeling demand uncertainty in two-tiered city logistics planning. Tech. rep., Publication CIRRELT-2012-65, Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport, 2012.

T. G. Crainic, Y. Gajpal, and M. Gendreau, Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows, INFOR: Information Systems and Operational Research, vol.22, issue.8, pp.2012-2048, 2012.
DOI : 10.1057/jors.1996.133

T. G. Crainic, S. Mancini, G. Perboli, and R. Tadei, Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem, Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, vol.6622, pp.179-190, 2011.
DOI : 10.1007/978-3-642-20364-0_16

T. G. Crainic, N. , R. Storchi, and G. , Models for Evaluating and Planning City Logistics Systems, Transportation Science, vol.43, issue.4, pp.432-454, 2009.
DOI : 10.1287/trsc.1090.0279

T. G. Crainic, G. Perboli, S. Mancini, and R. Tadei, Two-Echelon Vehicle Routing Problem: A satellite location analysis, Procedia - Social and Behavioral Sciences, vol.2, issue.3, pp.5944-5955, 2010.
DOI : 10.1016/j.sbspro.2010.04.009

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

D. Feillet, A tutorial on column generation and branch-and-price for vehicle routing problems, 4OR, vol.34, issue.1, pp.407-424, 2010.
DOI : 10.1007/s10288-010-0130-z
URL : https://hal.archives-ouvertes.fr/emse-00505959

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, vol.35, issue.3, pp.216-229, 2004.
DOI : 10.1002/net.20033

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

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.

V. C. Hemmelmayr, J. 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

M. Jepsen, S. Spoorendonk, and S. Ropke, A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem, Transportation Science, vol.47, issue.1, pp.23-37, 2012.
DOI : 10.1287/trsc.1110.0399

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

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

R. Masson, F. Lehuédé, and O. Péton, An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers, Transportation Science, vol.47, issue.3, pp.1-12, 2012.
DOI : 10.1287/trsc.1120.0432
URL : https://hal.archives-ouvertes.fr/hal-00597066

R. Masson, F. Lehuédé, and O. Péton, The dial-a-ride problem with transfers. Computers and Operations Research submitted, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00745813

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 Constraint Programming for Combinatorial Optimization Problems, pp.275-291, 2012.
DOI : 10.1007/978-3-642-29828-8_18
URL : https://hal.archives-ouvertes.fr/hal-00725239

R. Masson, F. Lehuédé, and O. Péton, Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers, Operations Research Letters, vol.41, issue.3, pp.211-215, 2013.
DOI : 10.1016/j.orl.2013.01.007
URL : https://hal.archives-ouvertes.fr/hal-00787577

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, 2013.
DOI : 10.1016/j.ejor.2013.08.042
URL : https://hal.archives-ouvertes.fr/hal-00859068

J. E. Mendoza, Solving real-world vehicle routing problems in uncertain environments, 4OR, vol.136, issue.1, pp.321-324, 2011.
DOI : 10.1007/s10288-010-0146-4
URL : https://hal.archives-ouvertes.fr/hal-00629459

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.

P. Nguyen, T. Crainic, and M. Toulouse, A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows, European Journal of Operational Research, vol.231, issue.1, pp.43-56, 2013.
DOI : 10.1016/j.ejor.2013.05.026

G. Perboli and R. Tadei, New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem, Electronic Notes in Discrete Mathematics, vol.36, pp.639-646, 2010.
DOI : 10.1016/j.endm.2010.05.081

G. Perboli, R. Tadei, and D. Vigo, The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics, Transportation Science, vol.45, issue.3, pp.364-380, 2011.
DOI : 10.1287/trsc.1110.0368

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

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

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

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.2703

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

R. Roberti, Exact algorithms for different classes of vehicle routing problems, 4OR, vol.11, issue.2, 2012.
DOI : 10.1007/s10288-012-0206-z

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 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 and D. Pisinger, A unified heuristic for a large class of Vehicle Routing Problems with Backhauls, European Journal of Operational Research, vol.171, issue.3, pp.750-775, 2006.
DOI : 10.1016/j.ejor.2004.09.004

M. W. Savelsbergh, The Vehicle Routing Problem with Time Windows: Minimizing Route Duration, ORSA Journal on Computing, vol.4, issue.2, pp.146-154, 1992.
DOI : 10.1287/ijoc.4.2.146

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

J. S. Shang and C. K. Cuff, 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

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. Stein, Scheduling Dial-a-Ride Transportation Systems, Transportation Science, vol.12, issue.3, pp.232-249, 1978.
DOI : 10.1287/trsc.12.3.232

A. Trentini, A. Campi, N. Malhéné, and F. Boscacci, Shared passengers & goods urban transport solutions: new ideas for milan through en international comparison, pp.38-44, 2011.

A. Trentini and N. Malhéné, Toward a shared urban transport system ensuring passengers & goods cohabitation, 2010.