{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T09:41:46Z","timestamp":1782898906907,"version":"3.54.5"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007229","name":"Bijzonder Onderzoeksfonds UGent","doi-asserted-by":"publisher","award":["BOF\/STA\/202009\/039"],"award-info":[{"award-number":["BOF\/STA\/202009\/039"]}],"id":[{"id":"10.13039\/501100007229","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012331","name":"Agentschap Innoveren en Ondernemen","doi-asserted-by":"publisher","award":["HBC.2020.3097"],"award-info":[{"award-number":["HBC.2020.3097"]}],"id":[{"id":"10.13039\/100012331","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Imec Coock"},{"name":"Imec Icon OptiRoutS"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00291-024-00762-2","type":"journal-article","created":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T14:02:10Z","timestamp":1714140130000},"page":"953-985","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The dynamic stochastic container drayage problem with truck appointment scheduling"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7972-5052","authenticated-orcid":false,"given":"Kenneth","family":"Stoop","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5817-7886","authenticated-orcid":false,"given":"Mario","family":"Pickavet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1428-0301","authenticated-orcid":false,"given":"Didier","family":"Colle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3319-4705","authenticated-orcid":false,"given":"Pieter","family":"Audenaert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,26]]},"reference":[{"issue":"1","key":"762_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.5.1.64","volume":"5","author":"LH Appelgren","year":"1971","unstructured":"Appelgren LH (1971) Integer programming methods for a vessel scheduling problem. Transp Sci 5(1):64\u201378","journal-title":"Transp Sci"},{"key":"762_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"2011","unstructured":"Birge JR, Louveaux F (2011) Introduction to stochastic programming. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4614-0237-4"},{"key":"762_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117170","volume":"201","author":"N Bjeli\u0107","year":"2022","unstructured":"Bjeli\u0107 N, Vidovi\u0107 M, Popovi\u0107 D, Ratkovi\u0107 B (2022) Rolling-horizon approach in solving dynamic multisize multi-trailer container drayage problem. Expert Syst Appl 201:117170","journal-title":"Expert Syst Appl"},{"issue":"6","key":"762_CR4","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1080\/01441647.2011.584979","volume":"31","author":"K Braekers","year":"2011","unstructured":"Braekers K, Janssens GK, Caris A (2011) Challenges in managing empty container movements at multiple planning levels. Transp Rev 31(6):681\u2013708","journal-title":"Transp Rev"},{"issue":"2","key":"762_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tre.2007.07.001","volume":"44","author":"H Chang","year":"2008","unstructured":"Chang H, Jula H, Chassiakos A, Ioannou P (2008) A heuristic solution for the empty container substitution problem. Transp Res Part E Logist Transp Rev 44(2):203\u2013216","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"762_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100369","volume":"40","author":"O Cheikhrouhou","year":"2021","unstructured":"Cheikhrouhou O, Khoufi I (2021) A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy. Comput Sci Rev 40:100369","journal-title":"Comput Sci Rev"},{"key":"762_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2021.102241","volume":"147","author":"R Chen","year":"2021","unstructured":"Chen R, Chen S, Cui H, Meng Q (2021) The container drayage problem for heterogeneous trucks with multiple loads: a revisit. Transp Res Part E Logist Transp Rev 147:102241","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"762_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103220","volume":"177","author":"R Chen","year":"2023","unstructured":"Chen R, Jia S, Meng Q (2023) Dynamic container drayage booking and routing decision support approach for e-commerce platforms. Transp Res Part E Logist Transp Rev 177:103220","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"3","key":"762_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.aei.2011.02.005","volume":"25","author":"A Escudero","year":"2011","unstructured":"Escudero A, Mu\u00f1uzuri J, Arango C, Onieva L (2011) A satellite navigation system to improve the management of intermodal drayage. Adv Eng Inform 25(3):427\u2013434","journal-title":"Adv Eng Inform"},{"issue":"2","key":"762_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.compind.2012.11.006","volume":"64","author":"A Escudero","year":"2013","unstructured":"Escudero A, Mu\u00f1uzuri J, Guadix J, Arango C (2013) Dynamic approach to solve the daily drayage problem with transit time uncertainty. Comput Ind 64(2):165\u2013175","journal-title":"Comput Ind"},{"key":"762_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.retrec.2020.100884","volume":"90","author":"A Escudero-Santana","year":"2021","unstructured":"Escudero-Santana A, Mu\u00f1uzuri J, Cort\u00e9s P, Onieva L (2021) The one container drayage problem with soft time windows. Res Transp Econ 90:100884","journal-title":"Res Transp Econ"},{"key":"762_CR12","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"issue":"1","key":"762_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3141\/2548-01","volume":"2548","author":"N Huynh","year":"2016","unstructured":"Huynh N, Smith D, Harder F (2016) Truck appointment systems: where we are and where to go from here. Transp Res Rec 2548(1):1\u20139","journal-title":"Transp Res Rec"},{"issue":"1","key":"762_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejor.2005.06.044","volume":"176","author":"A Imai","year":"2007","unstructured":"Imai A, Nishimura E, Current J (2007) A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur J Oper Res 176(1):87\u2013105","journal-title":"Eur J Oper Res"},{"key":"762_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.trb.2022.10.010","volume":"166","author":"S Jia","year":"2022","unstructured":"Jia S, Cui H, Chen R, Meng Q (2022) Dynamic container drayage with uncertain request arrival times and service time windows. Transp Res Part B Methodol 166:237\u2013258","journal-title":"Transp Res Part B Methodol"},{"issue":"3","key":"762_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.tre.2004.03.003","volume":"41","author":"H Jula","year":"2005","unstructured":"Jula H, Dessouky M, Ioannou P, Chassiakos A (2005) Container movement by trucks in metropolitan networks: modeling and optimization. Transp Res Part E Logist Transp Rev 41(3):235\u2013259","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"762_CR17","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.omega.2018.06.004","volume":"85","author":"KA Kuzmicz","year":"2019","unstructured":"Kuzmicz KA, Pesch E (2019) Approaches to empty container repositioning problems in the context of Eurasian intermodal transportation. Omega 85:194\u2013213","journal-title":"Omega"},{"issue":"3","key":"762_CR18","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/trsc.5.3.232","volume":"5","author":"A Levin","year":"1971","unstructured":"Levin A (1971) Scheduling and fleet routing models for transportation systems. Transp Sci 5(3):232\u2013255","journal-title":"Transp Sci"},{"issue":"1\u20132","key":"762_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.compchemeng.2007.05.009","volume":"32","author":"P Li","year":"2008","unstructured":"Li P, Arellano-Garcia H, Wozny G (2008) Chance constrained programming approach to process optimization under uncertainty. Comput Chem Eng 32(1\u20132):25\u201345","journal-title":"Comput Chem Eng"},{"key":"762_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tre.2014.06.016","volume":"70","author":"N Markovi\u0107","year":"2014","unstructured":"Markovi\u0107 N, Drobnjak \u017d, Schonfeld P (2014) Dispatching trucks for drayage operations. Transp Res Part E Logist Transp Rev 70:99\u2013111","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"1","key":"762_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s12065-021-00648-0","volume":"16","author":"E Messaoud","year":"2023","unstructured":"Messaoud E (2023) A chance constrained programming model and an improved large neighborhood search algorithm for the electric vehicle routing problem with stochastic travel times. Evol Intel 16(1):153\u2013168","journal-title":"Evol Intel"},{"issue":"2","key":"762_CR22","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.tre.2007.07.004","volume":"44","author":"R Namboothiri","year":"2008","unstructured":"Namboothiri R, Erera AL (2008) Planning local container drayage operations given a port access appointment system. Transp Res Part E Logist Transp Rev 44(2):185\u2013202","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"3","key":"762_CR23","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2013.04.042","volume":"230","author":"J Nossack","year":"2013","unstructured":"Nossack J, Pesch E (2013) A truck scheduling problem arising in intermodal container transportation. Eur J Oper Res 230(3):666\u2013680","journal-title":"Eur J Oper Res"},{"key":"762_CR24","unstructured":"OpenStreetMap Contributors: Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org (2020)"},{"issue":"3","key":"762_CR25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s13676-016-0100-5","volume":"7","author":"J Oyola","year":"2018","unstructured":"Oyola J, Arntzen H, Woodruff DL (2018) The stochastic vehicle routing problem, a literature review, part I: models. EURO J Transp Logist 7(3):193\u2013221","journal-title":"EURO J Transp Logist"},{"key":"762_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, Doerner KF, Hartl RF (2008a) A survey on pickup and delivery problems: Part I: transportation between customers and depot. J Betriebswirtschaft 58:21\u201351","journal-title":"J Betriebswirtschaft"},{"key":"762_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, Doerner KF, Hartl RF (2008b) A survey on pickup and delivery problems: Part II: transportation between pickup and delivery locations. J Betriebswirtschaft 58:81\u2013117","journal-title":"J Betriebswirtschaft"},{"key":"762_CR28","unstructured":"Rubbrecht I (2022) Economic importance of the Belgian maritime and inland ports\u2014report 2020. Technical report, NBB Working Paper"},{"key":"762_CR29","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ijpe.2016.03.005","volume":"176","author":"S Shiri","year":"2016","unstructured":"Shiri S, Huynh N (2016) Optimization of drayage operations with time-window constraints. Int J Prod Econ 176:7\u201320","journal-title":"Int J Prod Econ"},{"issue":"5","key":"762_CR30","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1080\/01605682.2018.1457487","volume":"70","author":"S Shiri","year":"2019","unstructured":"Shiri S, Ng M, Huynh N (2019) Integrated drayage scheduling problem with stochastic container packing and unpacking times. J Oper Res Soc 70(5):793\u2013806","journal-title":"J Oper Res Soc"},{"issue":"7","key":"762_CR31","doi-asserted-by":"publisher","first-page":"5638","DOI":"10.3390\/su15075638","volume":"15","author":"Y Song","year":"2023","unstructured":"Song Y, Zhang Y, Wang W, Xue M (2023) A branch and price algorithm for the drop-and-pickup container drayage problem with empty container constraints. Sustainability 15(7):5638","journal-title":"Sustainability"},{"key":"762_CR32","first-page":"8","volume":"1383","author":"LN Spasovic","year":"1993","unstructured":"Spasovic LN, Morlok EK (1993) Using marginal costs to evaluate drayage rates in rail-truck intermodal service. Transp Res Rec 1383:8\u201316","journal-title":"Transp Res Rec"},{"issue":"4","key":"762_CR33","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.cor.2012.11.015","volume":"40","author":"S Sterzik","year":"2013","unstructured":"Sterzik S, Kopfer H (2013) A Tabu search heuristic for the inland container transportation problem. Comput Oper Res 40(4):953\u2013962","journal-title":"Comput Oper Res"},{"key":"762_CR34","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.tre.2018.06.003","volume":"116","author":"M Torkjazi","year":"2018","unstructured":"Torkjazi M, Huynh N, Shiri S (2018) Truck appointment systems considering impact to drayage truck tours. Transp Res Part E Logist Transp Rev 116:208\u2013228","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"762_CR35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia. https:\/\/doi.org\/10.1137\/1.9780898718515"},{"key":"762_CR36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle routing","author":"P Toth","year":"2014","unstructured":"Toth P, Vigo D (2014) Vehicle routing. Society for Industrial and Applied Mathematics, Philadelphia. https:\/\/doi.org\/10.1137\/1.9781611973594"},{"issue":"2","key":"762_CR37","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0965-8564(00)00037-9","volume":"36","author":"X Wang","year":"2002","unstructured":"Wang X, Regan AC (2002) Local truckload pickup and delivery with hard time window constraints. Transp Res Part B Methodol 36(2):97\u2013112","journal-title":"Transp Res Part B Methodol"},{"key":"762_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102992","volume":"169","author":"X Yan","year":"2023","unstructured":"Yan X, Xu M, Xie C (2023) Local container drayage problem with improved truck platooning operations. Transp Res Part E Logist Transp Rev 169:102992","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"762_CR39","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1051\/ro\/2019063","volume":"55","author":"J You","year":"2021","unstructured":"You J, Zhang C, Xue Z, Miao L, Ye B (2021) A bi-objective model for robust local container drayage problem. RAIRO Oper Res 55:625\u2013646","journal-title":"RAIRO Oper Res"},{"key":"762_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103138","volume":"175","author":"J You","year":"2023","unstructured":"You J, Wang Y, Xue Z (2023) An exact algorithm for the multi-trip container drayage problem with truck platooning. Transp Res Part E Logist Transp Rev 175:103138","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"1\u20133","key":"762_CR41","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0925-5273(99)00074-2","volume":"64","author":"C-S Yu","year":"2000","unstructured":"Yu C-S, Li H-L (2000) A robust optimization model for stochastic logistic problems. Int J Prod Econ 64(1\u20133):385\u2013397","journal-title":"Int J Prod Econ"},{"issue":"6","key":"762_CR42","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.tre.2009.04.012","volume":"45","author":"R Zhang","year":"2009","unstructured":"Zhang R, Yun WY, Moon I (2009) A reactive Tabu search algorithm for the multi-depot container truck transportation problem. Transp Res Part E Logist Transp Rev 45(6):904\u2013914","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"762_CR43","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00291-010-0193-4","volume":"32","author":"R Zhang","year":"2010","unstructured":"Zhang R, Yun WY, Kopfer H (2010) Heuristic-based truck scheduling for inland container transportation. OR Spectr. 32:787\u2013808","journal-title":"OR Spectr."},{"issue":"1","key":"762_CR44","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.ijpe.2010.02.005","volume":"133","author":"R Zhang","year":"2011","unstructured":"Zhang R, Yun WY, Moon IK (2011) Modeling and optimization of a container drayage problem with resource constraints. Int J Prod Econ 133(1):351\u2013359","journal-title":"Int J Prod Econ"},{"key":"762_CR45","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.tre.2013.11.009","volume":"61","author":"R Zhang","year":"2014","unstructured":"Zhang R, Lu J-C, Wang D (2014) Container drayage problem with flexible orders and its near real-time solution strategies. Transp Res Part E Logist Transp Rev 61:235\u2013251","journal-title":"Transp Res Part E Logist Transp Rev"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00762-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-024-00762-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00762-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:06:16Z","timestamp":1722942376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-024-00762-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,26]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["762"],"URL":"https:\/\/doi.org\/10.1007\/s00291-024-00762-2","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,26]]},"assertion":[{"value":"10 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}