A. Agra, M. Christiansen, R. Figueiredo, L. M. Hvattum, M. Poss et al., Layered Formulation for the Robust Vehicle Routing Problem with Time Windows, Combinatorial Optimization, pp.249-260, 2012.
DOI : 10.1007/978-3-642-32147-4_23
URL : https://hal.archives-ouvertes.fr/hal-00777762

R. Baldacci, A. Mingozzi, and R. Roberti, New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem, Operations Research, vol.59, issue.5, pp.1269-1283, 2011.
DOI : 10.1287/opre.1110.0975

A. Ben-tal and A. Nemirovski, Robust Convex Optimization, Mathematics of Operations Research, vol.23, issue.4, pp.769-805, 1998.
DOI : 10.1287/moor.23.4.769

A. Ben-tal and A. Nemirovski, Robust solutions of uncertain linear programs, Operations Research Letters, vol.25, issue.1, pp.1-13, 1999.
DOI : 10.1016/S0167-6377(99)00016-4

A. Ben-tal and A. Nemirovski, Robust solutions of Linear Programming problems contaminated with uncertain data, Mathematical Programming, pp.411-424, 2000.
DOI : 10.1007/PL00011380

R. W. Bent and P. V. Hentenryck, Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers, Operations Research, vol.52, issue.6, pp.977-987, 2004.
DOI : 10.1287/opre.1040.0124

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

D. Bertsimas and M. Sim, The price of robustness, Operations research, pp.35-53, 2004.

J. Branke, M. Middendorf, G. Noeth, and M. Dessouky, Waiting strategies for dynamic vehicle routing, Transportation science, pp.298-312, 2005.

C. Contardo, B. Gendron, and J. Cordeau, A branch-andcut-and-price algorithm for the capacitated location-routing problem, CIRRELT, 2011.

J. Cordeau, A Branch-and-Cut Algorithm for the Dial-a-Ride Problem, Operations Research, vol.54, issue.3, pp.573-586, 2006.
DOI : 10.1287/opre.1060.0283

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

M. Desrochers and F. Soumis, A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows, INFOR: Information Systems and Operational Research, vol.26, issue.3, pp.191-212, 1988.
DOI : 10.1080/03155986.1988.11732063

J. Desrosiers, F. Soumis, and M. Desrochers, Routing with time windows by column generation, Networks, vol.14, issue.4, pp.14-545, 1984.
DOI : 10.1002/net.3230140406

B. Detienne, N. Rahmani, R. Sadykov, and F. Vanderbeck, Optimizing timing decisions in dial-a-ride problems, working paper (in preparation), 2014.

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.44-216, 2004.
DOI : 10.1002/net.20033

S. Gélinas, M. Desrochers, J. Desrosiers, and M. Solomon, A new branching strategy for time constrained routing problems with application to backhauling, Annals of Operations Research, vol.17, issue.1, pp.61-91, 1995.
DOI : 10.1007/BF02098283

L. E. Ghaoui and H. Lebret, Robust Solutions to Least-Squares Problems with Uncertain Data, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.4, pp.1035-1064, 1997.
DOI : 10.1137/S0895479896298130

L. E. Ghaoui, F. Oustry, and H. Lebret, Robust Solutions to Uncertain Semidefinite Programs, SIAM Journal on Optimization, vol.9, issue.1, pp.33-52, 1998.
DOI : 10.1137/S1052623496305717

G. Heilporn, J. Cordeau, and G. Laporte, An integer <mml:math altimg="si28.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>L</mml:mi></mml:math>-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays, Discrete Applied Mathematics, vol.159, issue.9, pp.883-895, 2011.
DOI : 10.1016/j.dam.2011.01.021

J. Hemert, J. Poutré-ppsn, X. Viii, E. Yao, J. Burke et al., Dynamic routing problems with fruitful regions: Models and evolutionary computation, in Parallel Problem Solving from Nature, Ti? no, A. Kabán, and H.-P

S. Ichoua, M. Gendreau, and J. Potvin, Diversion Issues in Real-Time Vehicle Dispatching, Transportation Science, vol.34, issue.4, pp.426-438, 2000.
DOI : 10.1287/trsc.34.4.426.12325

M. Junger and C. O. Laporte, Workshop, 50 years of integer programming, 1958-2008 from the early years to the state-of-the-art Waiting strategies for the dynamic pickup and delivery problem with time windows, Transportation Research Part B: Methodological, vol.29, pp.38-635, 2004.

S. Mitrovi?-mini?, R. Krishnamurti, and G. Laporte, Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows, Transportation Research Part B: Methodological, vol.38, issue.8, pp.669-685, 2004.
DOI : 10.1016/j.trb.2003.09.001

S. Parragh, J. Cordeau, K. Doerner, and R. Hartl, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, OR Spectrum, vol.37, issue.3, pp.593-633, 2012.
DOI : 10.1007/s00291-010-0229-9

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

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

W. B. Powell and Z. Chen, A generalized threshold algorithm for the shortest path problem with time windows, 1998.

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

V. Pureza and G. Laporte, Waiting and buffering strategies for the dynamic pickup and delivery problems with time windows, INFOR, pp.46-165, 2008.

A. C. Regan, H. S. Mahmassani, and P. Jaillet, Improving efficiency of commercial vehicle operations using real-time information: potential uses and assignment strategies, Transportation Research Record, vol.38, pp.188-198, 1995.

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 branchand-cut algorithms for pickup and delivery problems with time windows, Networks, pp.49-258, 2007.

M. Sigurd, D. Pisinger, and M. Sig, Scheduling Transportation of Live Animals to Avoid the Spread of Diseases, Transportation Science, vol.38, issue.2, pp.197-209, 2004.
DOI : 10.1287/trsc.1030.0053

M. Sol, Column Generation Techniques for Pickup and Delivery Problems, 1994.

A. L. Soyster, Technical Note???Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research, vol.21, issue.5, pp.1154-1157, 1973.
DOI : 10.1287/opre.21.5.1154

A. Thiele, T. Terry, and M. Epelman, Robust linear optimization with recourse, Rapport technique, pp.4-37, 2009.

B. W. Thomas, Waiting Strategies for Anticipating Service Requests from Known Customer Locations, Transportation Science, vol.41, issue.3, pp.41-319, 2007.
DOI : 10.1287/trsc.1060.0183

F. Vanderbeck, BaPCod: a generic branch-and-price code, depot APP 08-120018-000 IDDN, 2008.

F. Vanderbeck, Branching in branch-and-price: a generic scheme, Mathematical Programming, pp.249-294, 2011.
DOI : 10.1007/s10107-009-0334-1
URL : https://hal.archives-ouvertes.fr/inria-00311274