{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:03:40Z","timestamp":1784894620264,"version":"3.55.0"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:00:00Z","timestamp":1781222400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001804","name":"Canada Research Chairs Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN 2025-04995"],"award-info":[{"award-number":["RGPIN 2025-04995"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN 2023-03791"],"award-info":[{"award-number":["RGPIN 2023-03791"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2022-03964"],"award-info":[{"award-number":["RGPIN-2022-03964"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107569","type":"journal-article","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:16:33Z","timestamp":1780676193000},"page":"107569","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Improving column complementarity in a restricted master heuristic with a GRASP-guided completion: Application to the vehicle routing problem with stochastic demands"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5329-4943","authenticated-orcid":false,"given":"Ga\u00ebl","family":"Reynal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8742-0774","authenticated-orcid":false,"given":"Quentin","family":"Cappart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4469-9813","authenticated-orcid":false,"given":"Guy","family":"Desaulniers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.cor.2026.107569_b1","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.1016\/j.cor.2026.107569_b2","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/j.ejor.2021.10.047","article-title":"The min-max close-enough arc routing problem","volume":"300","author":"Bianchessi","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107569_b3","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.orl.2006.12.009","article-title":"A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands","volume":"35","author":"Christiansen","year":"2007","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.cor.2026.107569_b4","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/trsc.2018.0878","article-title":"Exact branch-price-and-cut algorithms for vehicle routing","volume":"53","author":"Costa","year":"2019","journal-title":"Transp. Sci."},{"issue":"2","key":"10.1016\/j.cor.2026.107569_b5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"issue":"5","key":"10.1016\/j.cor.2026.107569_b6","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1287\/trsc.2022.1129","article-title":"Vehicle routing with stochastic demands and partial reoptimization","volume":"56","author":"Florio","year":"2022","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2026.107569_b7","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1016\/j.ejor.2022.10.045","article-title":"Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut","volume":"306","author":"Florio","year":"2023","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107569_b8","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1287\/trsc.2020.0976","article-title":"New exact algorithm for the vehicle routing problem with stochastic demands","volume":"54","author":"Florio","year":"2020","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107569_b9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2014.03.028","article-title":"A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands","volume":"50","author":"Gauvin","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107569_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2023.103237","article-title":"Maximizing robustness of aircraft routing with heterogeneous maintenance tasks","volume":"177","author":"He","year":"2023","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"1","key":"10.1016\/j.cor.2026.107569_b11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ejor.2024.09.007","article-title":"An evaluation of common modeling choices for the vehicle routing problem with stochastic demands","volume":"321","author":"Hoogendoorn","year":"2025","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107569_b12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/trsc.1100.0353","article-title":"Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands","volume":"45","author":"Mendoza","year":"2011","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107569_b13","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10732-015-9281-6","article-title":"A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints","volume":"22","author":"Mendoza","year":"2016","journal-title":"J. Heuristics"},{"issue":"1","key":"10.1016\/j.cor.2026.107569_b14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10479-021-04488-0","article-title":"Vehicle routing problems over time: a survey","volume":"314","author":"Mor","year":"2022","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107569_b15","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1002\/net.22238","article-title":"A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem","volume":"84","author":"Petris","year":"2024","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.cor.2026.107569_b16","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/ijoc.2018.0822","article-title":"Primal heuristics for branch and price: The assets of diving methods","volume":"31","author":"Sadykov","year":"2019","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107569_b17","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.3.3.192","article-title":"The multiple terminal delivery problem with probabilistic demands","volume":"3","author":"Tillman","year":"1969","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2026.107569_b18","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","article-title":"New benchmark instances for the capacitated vehicle routing problem","volume":"257","author":"Uchoa","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107569_b19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/nav.3800270114","article-title":"A note on determining operating strategies for probabilistic vehicle routing","volume":"27","author":"Yee","year":"1980","journal-title":"Nav. Res. Logist. Q."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001875?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001875?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T11:40:45Z","timestamp":1784893245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":19,"alternative-id":["S0305054826001875"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107569","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improving column complementarity in a restricted master heuristic with a GRASP-guided completion: Application to the vehicle routing problem with stochastic demands","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107569","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107569"}}