{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:02:19Z","timestamp":1781298139061,"version":"3.54.1"},"reference-count":36,"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,4,28]],"date-time":"2026-04-28T00:00:00Z","timestamp":1777334400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","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.107507","type":"journal-article","created":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T15:26:49Z","timestamp":1778945209000},"page":"107507","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The vehicle routing problem with driver scheduling"],"prefix":"10.1016","volume":"194","author":[{"given":"Razieh","family":"Mousavi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6437-7638","authenticated-orcid":false,"given":"Jean-Fran\u00e7ois","family":"C\u00f4t\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0929-4864","authenticated-orcid":false,"given":"Maryam","family":"Darvish","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.cor.2026.107507_b1","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","article-title":"An indirect genetic algorithm for a nurse-scheduling problem","volume":"31","author":"Aickelin","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107507_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2019.102139","article-title":"Crowdsourced delivery: A review of platforms and academic literature","volume":"98","author":"Alnaggar","year":"2021","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107507_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106059","article-title":"A data-driven compensation scheme for last-mile delivery with crowdsourcing","volume":"150","author":"Barbosa","year":"2023","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107507_b4","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/S0305-0548(02)00048-5","article-title":"Staff scheduling at the United States postal service","volume":"30","author":"Bard","year":"2003","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107507_b5","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1287\/trsc.2022.1152","article-title":"A prescriptive machine learning method for courier scheduling on crowdsourced delivery platforms","volume":"57","author":"Behrendt","year":"2023","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2026.107507_b6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","article-title":"Personnel scheduling: A literature review","volume":"226","author":"Van den Bergh","year":"2013","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107507_b7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10729-008-9095-2","article-title":"Flexible shift scheduling of physicians","volume":"12","author":"Brunner","year":"2009","journal-title":"Health Care Manag. Sci."},{"issue":"5","key":"10.1016\/j.cor.2026.107507_b8","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","article-title":"Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows","volume":"55","author":"Cordeau","year":"2004","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2026.107507_b9","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.ejor.2017.08.059","article-title":"A model enhancement approach for optimizing the integrated shift scheduling and vehicle routing problem in waste collection","volume":"266","author":"De Bruecker","year":"2018","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107507_b10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","article-title":"Staff scheduling and rostering: A review of applications, methods and models","volume":"153","author":"Ernst","year":"2004","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107507_b11","article-title":"A double-horizon approach to a purely dynamic and stochastic vehicle routing problem with delivery deadlines and shift flexibility","volume":"vol. 1","author":"Frohner","year":"2021"},{"key":"10.1016\/j.cor.2026.107507_b12","series-title":"Canada last mile delivery market size & outlook, 2023\u20132030","author":"Grand View Research","year":"2023"},{"issue":"1","key":"10.1016\/j.cor.2026.107507_b13","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ejor.2018.11.025","article-title":"A set partitioning heuristic for the home health care routing and scheduling problem","volume":"275","author":"Grenouilleau","year":"2019","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107507_b14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12532-010-0013-5","article-title":"A library of local search heuristics for the vehicle routing problem","volume":"2","author":"Gro\u00ebr","year":"2010","journal-title":"Math. Program. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107507_b15","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","article-title":"An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria","volume":"34","author":"Gutjahr","year":"2007","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2026.107507_b16","doi-asserted-by":"crossref","first-page":"3331","DOI":"10.1016\/j.cor.2012.04.018","article-title":"A constraint programming based column generation approach to nurse rostering problems","volume":"39","author":"He","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107507_b17","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/nav.20053","article-title":"The hungarian method for the assignment problem","volume":"52","author":"Kuhn","year":"2004","journal-title":"Naval Res. Logist. (NRL)"},{"key":"10.1016\/j.cor.2026.107507_b18","series-title":"Advancements in last-mile delivery transforming Canada","author":"Lee","year":"2025"},{"issue":"2","key":"10.1016\/j.cor.2026.107507_b19","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/msom.2022.1171","article-title":"On-demand delivery from stores: Dynamic dispatching and routing with random demand","volume":"25","author":"Liu","year":"2023","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"10.1016\/j.cor.2026.107507_b20","series-title":"Handbook of Metaheuristics","first-page":"320","article-title":"Iterated local search","author":"Louren\u00e7o","year":"2003"},{"key":"10.1016\/j.cor.2026.107507_b21","first-page":"1","article-title":"Bundle generation for the vehicle routing problem with occasional drivers and time windows","author":"Mancini","year":"2024","journal-title":"Flex. Serv. Manuf. J."},{"issue":"3","key":"10.1016\/j.cor.2026.107507_b22","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1016\/j.ejor.2020.12.064","article-title":"The collaborative consistent vehicle routing problem with workload balance","volume":"293","author":"Mancini","year":"2021","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107507_b23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.ejor.2024.12.006","article-title":"Tactical workforce sizing and scheduling decisions for last-mile delivery","volume":"323","author":"Mandal","year":"2025","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107507_b24","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1287\/ijoc.2023.0106","article-title":"AILS-II: An adaptive iterated local search heuristic for the large-scale capacitated vehicle routing problem","volume":"36","author":"Maximo","year":"2024","journal-title":"INFORMS J. Comput."},{"issue":"12","key":"10.1016\/j.cor.2026.107507_b25","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","article-title":"An exchange heuristic for routeing problems with time windows","volume":"46","author":"Potvin","year":"1995","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2026.107507_b26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10951-009-0114-z","article-title":"Implicit shift scheduling with multiple breaks and work stretch duration restrictions","volume":"13","author":"Rekik","year":"2010","journal-title":"J. Sched."},{"issue":"11","key":"10.1016\/j.cor.2026.107507_b27","doi-asserted-by":"crossref","first-page":"1987","DOI":"10.1016\/j.cor.2010.01.016","article-title":"The multi-shift vehicle routing problem with overtime","volume":"37","author":"Ren","year":"2010","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107507_b28","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","article-title":"The vehicle routing problem with time windows: Minimizing route duration","volume":"4","author":"Savelsbergh","year":"1992","journal-title":"ORSA J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107507_b29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.ejor.2012.03.016","article-title":"A hybrid algorithm for the heterogeneous fleet vehicle routing problem","volume":"221","author":"Subramanian","year":"2012","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107507_b30","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107507_b31","series-title":"The Outlook for Canada\u2019s Transportation Sector 2020\u20132040 (Post-COVID-19)","author":"The Conference Board of Canada","year":"2021"},{"issue":"4","key":"10.1016\/j.cor.2026.107507_b32","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1287\/trsc.2020.0977","article-title":"Workforce scheduling in the era of crowdsourced delivery","volume":"54","author":"Ulmer","year":"2020","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107507_b33","series-title":"Occupational employment and wages, may 2023: 53-3031 driver\/sales workers","author":"U.S. Bureau of Labor Statistics","year":"2024"},{"issue":"1","key":"10.1016\/j.cor.2026.107507_b34","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.ejor.2023.02.040","article-title":"A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements","volume":"310","author":"Wang","year":"2023","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107507_b35","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103633","article-title":"Tackling the crowdsourced shared-trip delivery problem at scale with a novel decomposition heuristic","volume":"188","author":"Yang","year":"2024","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2026.107507_b36","article-title":"Dynamic crowdsourcing problem in urban\u2013rural distribution using the learning-based approach","author":"Zhang","year":"2025","journal-title":"Comput. Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T20:41:51Z","timestamp":1781296911000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":36,"alternative-id":["S0305054826001255"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107507","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":"The vehicle routing problem with driver scheduling","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107507","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107507"}}