{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:36:31Z","timestamp":1773084991218,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":780,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s13676-016-0101-4","type":"journal-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T03:57:14Z","timestamp":1480478234000},"page":"223-251","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":56,"title":["The vehicle routing problem with hard time windows and stochastic service times"],"prefix":"10.1016","volume":"7","author":[{"given":"F.","family":"Errico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Desaulniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Gendreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Rei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.-M.","family":"Rousseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13676-016-0101-4_bib1","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1287\/trsc.2014.0581","article-title":"Models and algorithms for stochastic and robust vehicle routing with deadlines","volume":"50","author":"Adulyasak","year":"2014","journal-title":"Transp Sci"},{"issue":"5","key":"10.1007\/s13676-016-0101-4_bib2","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","article-title":"New route relaxation and pricing strategies for the vehicle routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib3","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1287\/opre.40.3.574","article-title":"A vehicle routing problem with stochastic demand","volume":"40","author":"Bertsimas","year":"1992","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-016-0101-4_bib4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.orl.2004.11.011","article-title":"Accelerated label setting algorithms for the elementary resource constrained shortest path problem","volume":"34","author":"Boland","year":"2006","journal-title":"Oper Res Lett"},{"issue":"1","key":"10.1007\/s13676-016-0101-4_bib5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.1070.0203","article-title":"Probabilistic traveling salesman problem with deadlines","volume":"42","author":"Campbell","year":"2008","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib6","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.ejor.2008.10.012","article-title":"A stochastic dynamic traveling salesman problem with hard time windows","volume":"198","author":"Chang","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13676-016-0101-4_bib7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.ejor.2014.03.006","article-title":"Branch-and-price and constraint programming for solving a real-life technician dispatching problem","volume":"238","author":"Cort\u00e9s","year":"2014","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/trsc.1070.0223","article-title":"Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows","volume":"42","author":"Desaulniers","year":"2008","journal-title":"Transp Sci"},{"issue":"5","key":"10.1007\/s13676-016-0101-4_bib9","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","article-title":"Note on the complexity of the shortest path models for column generation in VRPTW","volume":"42","author":"Dror","year":"1994","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-016-0101-4_bib10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2015.07.027","article-title":"A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times","volume":"249","author":"Errico","year":"2015","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","article-title":"An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems","volume":"44","author":"Feillet","year":"2004","journal-title":"Networks"},{"key":"10.1007\/s13676-016-0101-4_bib12","doi-asserted-by":"crossref","unstructured":"Gendreau M, Jabali O, Rei W (2014) Stochastic vehicle routing problems. Vehicle routing: problems, methods, and applications, 2nd edn, Chapter 8. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp 213\u2013239","DOI":"10.1137\/1.9781611973594.ch8"},{"issue":"2","key":"10.1007\/s13676-016-0101-4_bib13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/trsc.29.2.143","article-title":"An exact algorithm for the vehicle routing problem with stochastic demands and customers","volume":"29","author":"Gendreau","year":"1995","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-016-0101-4_bib14","doi-asserted-by":"crossref","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints, Chapter 2, GERAD 25th Anniversary Series. Springer, Berlin, pp 33\u201365","DOI":"10.1007\/0-387-25486-2_2"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","article-title":"The shortest-path problem with resource constraints and k-cycle elimination for k\u22653","volume":"18","author":"Irnich","year":"2006","journal-title":"INFORMS J Comput"},{"issue":"2","key":"10.1007\/s13676-016-0101-4_bib16","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","article-title":"Subset-row inequalities applied to the vehicle-routing problem with time windows","volume":"56","author":"Jepsen","year":"2008","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-016-0101-4_bib17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TITS.2006.869596","article-title":"Truck route planning in nonstationary stochastic networks with time windows at customer locations","volume":"7","author":"Jula","year":"2006","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"1","key":"10.1007\/s13676-016-0101-4_bib18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.37.1.69.12820","article-title":"Stochastic vehicle routing with random travel times","volume":"37","author":"Kenyon","year":"2003","journal-title":"Transp Sci"},{"issue":"7","key":"10.1007\/s13676-016-0101-4_bib19","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1016\/0305-0548(93)90064-P","article-title":"Designing collection routes through bank branches","volume":"20","author":"Lambert","year":"1993","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/opre.50.3.415.7751","article-title":"An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands","volume":"50","author":"Laporte","year":"2002","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.26.3.161","article-title":"The vehicle routing problem with stochastic travel times","volume":"26","author":"Laporte","year":"1992","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-016-0101-4_bib22","doi-asserted-by":"crossref","first-page":"1294","DOI":"10.1057\/jors.2011.136","article-title":"Robust vehicle routing problem with deadlines and travel time\/demand uncertainty","volume":"60","author":"Lee","year":"2012","journal-title":"J Oper Res Soc"},{"key":"10.1007\/s13676-016-0101-4_bib23","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s11750-011-0188-6","article-title":"A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times","volume":"20","author":"Lei","year":"2012","journal-title":"Top"},{"issue":"1","key":"10.1007\/s13676-016-0101-4_bib24","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ijpe.2010.01.013","article-title":"Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm","volume":"125","author":"Li","year":"2010","journal-title":"Int J Prod Econ"},{"issue":"6","key":"10.1007\/s13676-016-0101-4_bib25","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","article-title":"Selected topics in column generation","volume":"53","author":"L\u00fcbbecke","year":"2005","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/net.20212","article-title":"New dynamic programming algorithms for the resource constrained elementary shortest path problem","volume":"51","author":"Righini","year":"2008","journal-title":"Networks"},{"key":"10.1007\/s13676-016-0101-4_bib27","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper Res"},{"key":"10.1007\/s13676-016-0101-4_bib28","doi-asserted-by":"crossref","unstructured":"Souyris S, Cort\u00e9s CE, Ord\u00f3\u00f1ez F, Weintraub A (2013) A robust optimization approach to dispatching technicians under stochastic service times. Optim Lett 7(7):1549\u20131568","DOI":"10.1007\/s11590-012-0557-6"},{"issue":"2","key":"10.1007\/s13676-016-0101-4_bib29","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/trsc.1090.0303","article-title":"A model and algorithm for the courier delivery problem with uncertainty","volume":"44","author":"Sungur","year":"2010","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-016-0101-4_bib30","doi-asserted-by":"crossref","unstructured":"Ta\u015f D, Dellaert N, van Woensel T, de Kok T (2012) Vehicle routing problem with stochastic travel times including soft time windows and service costs. Technical report, Beta Research School for Operations Management and Logistics. WP 364","DOI":"10.1016\/j.cor.2012.06.008"},{"issue":"3","key":"10.1007\/s13676-016-0101-4_bib31","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/j.ejor.2013.05.024","article-title":"Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach","volume":"236","author":"Ta\u015f","year":"2014","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-016-0101-4_bib32","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3141\/1771-08","article-title":"Assignment models for local truckload trucking problems with stochastic service times and time window constraints","volume":"1771","author":"Wang","year":"2001","journal-title":"Transp Res Rec"},{"key":"10.1007\/s13676-016-0101-4_bib33","unstructured":"Wellman M, Ford M, Larson K (1995) Path planning under time-dependent uncertainty. In: Proceedings of the eleventh conference on uncertainty in artificial intelligence, August 18\u201320, 1995. Montr\u00e9al, pp 532\u2013539"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-016-0101-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-016-0101-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300650?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300650?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-016-0101-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:43:38Z","timestamp":1761882218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["S2192437620300650"],"URL":"https:\/\/doi.org\/10.1007\/s13676-016-0101-4","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The vehicle routing problem with hard time windows and stochastic service times","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-016-0101-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}