N. Agatz, A. M. Campbell, M. Fleischmann, and M. Savelsbergh, Challenges and opportunities in attended home delivery. The vehicle routing problem: latest advances and new challenges, pp.379-396, 2008.

N. Agatz, A. M. Campbell, M. Fleischmann, and M. Savelsbergh, Time slot management in attended home delivery, Transportation Science, vol.45, issue.3, pp.435-449, 2011.

R. W. Bent and P. Van-hentenryck, Scenario-based planning for partially dynamic vehicle routing with stochastic customers, Operations Research, vol.52, issue.6, pp.977-987, 2004.

J. R. Birge and F. V. Louveaux, A multicut algorithm for two-stage stochastic linear programs, European Journal of Operational Research, vol.34, issue.3, pp.384-392, 1988.

A. M. Campbell and M. Savelsbergh, Decision support for consumer direct grocery initiatives, Transportation Science, vol.39, issue.3, pp.313-327, 2005.

A. M. Campbell and M. Savelsbergh, Incentive schemes for attended home delivery services, Transportation science, vol.40, issue.3, pp.327-341, 2006.

J. F. Ehmke and A. M. Campbell, Customer acceptance mechanisms for home deliveries in metropolitan areas, European Journal of Operational Research, vol.233, issue.1, pp.193-207, 2014.

, Integrated Shift Scheduling and Load Assignement Optimizatin for Attended Home Delivery

F. Hernandez, M. Gendreau, and J. Y. Potvin, Heuristics for time slot management: A periodic vehicle routing problem view, 2014.

R. Klein, M. Neugebauer, D. Ratkovitch, and C. Steinhardt, Differentiated time slot pricing under routing considerations in attended home delivery. Available at SSRN 2674061, 2016.

G. Laporte and F. V. Louveaux, The integer L-shaped method for stochastic integer programs with complete recourse, Operations research letters, vol.13, issue.3, pp.133-142, 1993.

M. Krishnamurti, R. Laporte, and G. , 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.

D. Mcdaniel and M. Devine, A modified Benders' partitioning algorithm for mixed integer programming, Management Science, vol.24, issue.3, pp.312-319, 1977.

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.
URL : https://hal.archives-ouvertes.fr/hal-01140451

U. Ritzinger, J. Puchinger, and R. F. Hartl, A survey on dynamic and stochastic vehicle routing problems, International Journal of Production Research, vol.54, issue.1, pp.1-17, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01224562

I. Sungur, Y. Ren, F. Ordóñez, M. Dessouky, and H. Zhong, A model and algorithm for the courier delivery problem with uncertainty, Transportation Science, vol.44, issue.2, pp.193-205, 2010.

M. W. Ulmer, D. C. Mattfeld, M. Hennig, and J. C. Goodson, Logistics Management: Contributions of the Section Logistics of the German Academic Association for Business Research, pp.217-227, 2015.

M. W. Ulmer, D. C. Mattfeld, and F. Köster, Anticipation of stochastic customer requests in vehicle routing: Value function approximation based on a dynamic lookup-table, 2014.

R. M. Van-slyke and R. Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM Journal on Applied Mathematics, vol.17, issue.4, pp.638-663, 1969.

L. A. Wolsey and G. L. Nemhauser, Integer and combinatorial optimization, 1999.

S. Yan, J. R. Lin, and C. W. Lai, The planning and real-time adjustment of courier routing and scheduling under stochastic travel times and demands, Transportation Research Part E: Logistics and Transportation Review, vol.53, pp.34-48, 2013.

X. Yang, A. K. Strauss, C. S. Currie, and R. Eglese, Choice-based demand management and vehicle routing in e-fulfillment, Transportation science, vol.50, issue.2, pp.473-488, 2016.

, Integrated Shift Scheduling and Load Assignement Optimizatin for Attended Home Delivery