{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:39:14Z","timestamp":1762292354022,"version":"build-2065373602"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T00:00:00Z","timestamp":1747094400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.cor.2025.107123","type":"journal-article","created":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T18:32:51Z","timestamp":1749925971000},"page":"107123","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Algorithms for pickup and delivery problems with hours of service constraints"],"prefix":"10.1016","volume":"183","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2738","authenticated-orcid":false,"given":"Lucas","family":"Sippel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2240-7245","authenticated-orcid":false,"given":"Michael A.","family":"Forbes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1176-8619","authenticated-orcid":false,"given":"Joseph","family":"Menesch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.cor.2025.107123_b1","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1287\/trsc.2019.0905","article-title":"An exact algorithm for the pickup and delivery problem with time windows and last-in-first-out loading","volume":"53","author":"Alyasiry","year":"2019","journal-title":"Transp. Sci."},{"issue":"4","key":"10.1016\/j.cor.2025.107123_b2","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/trsc.1090.0278","article-title":"The trip scheduling problem","volume":"43","author":"Archetti","year":"2009","journal-title":"Transp. Sci."},{"issue":"2","key":"10.1016\/j.cor.2025.107123_b3","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/opre.1100.0881","article-title":"An exact algorithm for the pickup and delivery problem with time windows","volume":"59","author":"Baldacci","year":"2011","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2025.107123_b4","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1287\/opre.2017.1624","article-title":"The continuous-time service network design problem","volume":"65","author":"Boland","year":"2017","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107123_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2022.102922","article-title":"Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations","volume":"168","author":"Bustos-Coral","year":"2022","journal-title":"Transp. Res. Part E, Logist. Transp. Rev."},{"issue":"4","key":"10.1016\/j.cor.2025.107123_b6","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1287\/trsc.2014.0535","article-title":"Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading","volume":"49","author":"Cherkesly","year":"2015","journal-title":"Transp. Sci."},{"year":"2017","series-title":"Learning combinatorial optimization algorithms over graphs","author":"Dai","key":"10.1016\/j.cor.2025.107123_b7"},{"issue":"1","key":"10.1016\/j.cor.2025.107123_b8","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pickup and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"European J. Oper. Res."},{"issue":"248","key":"10.1016\/j.cor.2025.107123_b9","first-page":"81134","article-title":"Hours of service of drivers","volume":"76","author":"Federal Motor Carrier Safety, Administration","year":"2011","journal-title":"Fed. Regist."},{"issue":"4","key":"10.1016\/j.cor.2025.107123_b10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/trsc.1100.0330","article-title":"Truck driver scheduling in the European union","volume":"44","author":"Goel","year":"2010","journal-title":"Transp. Sci."},{"issue":"4","key":"10.1016\/j.cor.2025.107123_b11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s13676-012-0014-9","article-title":"The minimum duration truck driver scheduling problem","volume":"1","author":"Goel","year":"2012","journal-title":"EURO J. Transp. Logist."},{"key":"10.1016\/j.cor.2025.107123_b12","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.tre.2018.02.011","article-title":"Legal aspects in road transport optimization in Europe","volume":"114","author":"Goel","year":"2018","journal-title":"Transp. Res. Part E, Logist. Transp. Rev."},{"issue":"5","key":"10.1016\/j.cor.2025.107123_b13","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1016\/j.cor.2011.05.021","article-title":"Truck driver scheduling in Australia","volume":"39","author":"Goel","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2025.107123_b14","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1287\/trsc.2016.0678","article-title":"An exact method for vehicle routing and truck driver scheduling problems","volume":"51","author":"Goel","year":"2017","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2025.107123_b15","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1287\/trsc.1110.0382","article-title":"Truck driver scheduling in the United States","volume":"46","author":"Goel","year":"2012","journal-title":"Transp. Sci."},{"issue":"6","key":"10.1016\/j.cor.2025.107123_b16","first-page":"783","article-title":"Truck driver scheduling in Canada","volume":"15","author":"Goel","year":"2011","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2025.107123_b17","series-title":"Column Generation","first-page":"33","author":"Irnich","year":"2005"},{"issue":"2","key":"10.1016\/j.cor.2025.107123_b18","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."},{"year":"2019","series-title":"Scheduling and Routing of Truck Drivers Considering Regulations on Drivers\u2019 Working Hours","author":"Kleff","key":"10.1016\/j.cor.2025.107123_b19"},{"issue":"5","key":"10.1016\/j.cor.2025.107123_b20","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1287\/trsc.2021.1044","article-title":"A new formulation for the dial-a-ride problem","volume":"55","author":"Rist","year":"2021","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2025.107123_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105649","article-title":"A column generation and combinatorial benders decomposition algorithm for the selective dial-a-ride-problem","volume":"140","author":"Rist","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107123_b22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transp. Sci."},{"issue":"4","key":"10.1016\/j.cor.2025.107123_b23","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Global Optim."},{"issue":"6","key":"10.1016\/j.cor.2025.107123_b24","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1287\/trsc.2021.1084","article-title":"An improved integral column generation algorithm using machine learning for aircrew pairing","volume":"55","author":"Tahir","year":"2021","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.cor.2025.107123_b25","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.ejor.2019.10.038","article-title":"Bidirectional labeling for solving vehicle routing and truck driver scheduling problems","volume":"283","author":"Tilk","year":"2020","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107123_b26","doi-asserted-by":"crossref","first-page":"108418","DOI":"10.1109\/ACCESS.2020.3000236","article-title":"A graph neural network assisted Monte Carlo tree search approach to traveling salesman problem","volume":"8","author":"Xing","year":"2020","journal-title":"IEEE Access"},{"issue":"3","key":"10.1016\/j.cor.2025.107123_b27","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","article-title":"Solving a practical pickup and delivery problem","volume":"37","author":"Xu","year":"2003","journal-title":"Transp. Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825001510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825001510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:23:34Z","timestamp":1762291414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825001510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":27,"alternative-id":["S0305054825001510"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2025.107123","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Algorithms for pickup and delivery problems with hours of service constraints","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2025.107123","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107123"}}