{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:07:41Z","timestamp":1761293261289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180076"},{"type":"electronic","value":"9783319180083"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_25","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"357-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW"],"prefix":"10.1007","author":[{"given":"Michael","family":"Saint-Guillain","sequence":"first","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"25_CR1","unstructured":"Ahmed, S., Shapiro, A.: The sample average approximation method for stochastic programs with integer recourse (Submitted for publication, 2002)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Asmussen, S., Glynn, P.W.: Stochastic Simulation: Algorithms and Analysis: Algorithms and Analysis, vol. 57. Springer (2007)","DOI":"10.1007\/978-0-387-69033-9"},{"key":"25_CR3","unstructured":"Bent, R., Van Hentenryck, P.: Regrets only! online stochastic optimization under time constraints. In: AAAI, pp. 501\u2013506 (2004)"},{"key":"25_CR4","unstructured":"Bent, R., Van Hentenryck, P.: The value of consensus in online stochastic scheduling. In: ICAPS, (1), pp. 219\u2013226 (2004)"},{"key":"25_CR5","unstructured":"Bent, R., Van Hentenryck, P.: Waiting and relocation strategies in online stochastic vehicle routing. In: IJCAI, pp. 1816\u20131821 (2007)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11564751_12","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"R Bent","year":"2005","unstructured":"Bent, R., Katriel, I., Van Hentenryck, P.: Sub-optimality approximations. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 122\u2013136. Springer, Heidelberg (2005)"},{"issue":"6","key":"25_CR7","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1287\/opre.1040.0124","volume":"52","author":"RW Bent","year":"2004","unstructured":"Bent, R.W., Van Hentenryck, P.: Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research 52(6), 977\u2013987 (2004)","journal-title":"Operations Research"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Bertsimas, D.J., Van Ryzin, G.: A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research (1991)","DOI":"10.1287\/opre.39.4.601"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Bertsimas, D.J., Van Ryzin, G.: Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles. Operations Research (1993)","DOI":"10.1287\/opre.41.1.60"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10288-002-0009-8","volume":"1","author":"J-F Cordeau","year":"2003","unstructured":"Cordeau, J.-F., Laporte, G.: The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 4OR: A Quarterly Journal of Operations Research 1(2), 89\u2013101 (2003)","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Mathematical Programming 91(2), 201\u2013213 (2002)","journal-title":"Mathematical Programming"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Flatberg, T., Hasle, G., Kloster, O., Nilssen, E.J., Riise, A.: Dynamic and stochastic vehicle routing in practice. In: Dynamic Fleet Management, pp. 41\u201363. Springer (2007)","DOI":"10.1007\/978-0-387-71722-7_3"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tre.2008.08.003","volume":"45","author":"G Ghiani","year":"2009","unstructured":"Ghiani, G., Manni, E., Quaranta, A., Triki, C.: Anticipatory algorithms for same-day courier dispatching. Transportation Research Part E: Logistics and Transportation Review 45(1), 96\u2013106 (2009)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1287\/trsc.1060.0166","volume":"40","author":"LM Hvattum","year":"2006","unstructured":"Hvattum, L.M., L\u00f8kketangen, A., Laporte, G.: Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic. Transportation Science 40(4), 421\u2013438 (2006)","journal-title":"Transportation Science"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/trsc.1050.0114","volume":"40","author":"S Ichoua","year":"2006","unstructured":"Ichoua, S., Gendreau, M., Potvin, J.-Y.: Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching. Transportation Science 40(2), 211\u2013225 (2006)","journal-title":"Transportation Science"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In: Local Search in Combinatorial Optimization, pp. 337\u2013360 (1997)","DOI":"10.2307\/j.ctv346t9c.15"},{"issue":"7","key":"25_CR17","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological 38(7), 635\u2013655 (2004)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gendreau, M., Gu\u00e9ret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. European Journal of Operational Research 225(1), 1\u201311 (2013)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"25_CR19","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.dss.2012.06.007","volume":"54","author":"V Pillac","year":"2012","unstructured":"Pillac, V., Gu\u00e9ret, C., Medaglia, A.L.: An event-driven optimization framework for dynamic vehicle routing. Decision Support Systems 54(1), 414\u2013423 (2012)","journal-title":"Decision Support Systems"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14(2), 130\u2013154 (1980)","journal-title":"Transportation Science"},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"HN Psaraftis","year":"1995","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing: Status and prospects. Annals of Operations Research 61(1), 143\u2013164 (1995)","journal-title":"Annals of Operations Research"},{"issue":"12","key":"25_CR22","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"38","author":"M Schilde","year":"2011","unstructured":"Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & Operations Research 38(12), 1719\u20131730 (2011)","journal-title":"Computers & Operations Research"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.P.: Lectures on stochastic programming: modeling and theory, vol. 9. SIAM (2009)","DOI":"10.1137\/1.9780898718751"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2) (1987)","DOI":"10.1287\/opre.35.2.254"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Taillard, \u00c9., Badeau, P.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation..., pp. 1\u201336 (1997)","DOI":"10.1287\/trsc.31.2.170"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., Bent, R., Upfal, E.: Online stochastic optimization under time constraints, vol. 177 (September 2009)","DOI":"10.1007\/s10479-009-0605-5"},{"issue":"2\u20133","key":"25_CR28","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Computational Optimization and Applications 24(2\u20133), 289\u2013333 (2003)","journal-title":"Computational Optimization and Applications"},{"key":"25_CR29","unstructured":"Wilson, N.H.M., Colvin, N.J.: Computer control of the Rochester dial-a-ride system. Massachusetts Institute of Technology, Center for Transportation Studies (1977)"},{"key":"25_CR30","unstructured":"Saint-Guillain, M., Deville, Y., Solnon, C.: A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW (2015). Extended version. arXiv:1502.01972 [cs.AI]"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T12:03:01Z","timestamp":1609416181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}