{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:48:19Z","timestamp":1774727299228,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10878-026-01410-x","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T15:48:55Z","timestamp":1772898535000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online dispatching and routing for automated guided vehicles in pickup and delivery systems on loop-based graphs"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9873-8966","authenticated-orcid":false,"given":"Louis","family":"Stubbe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9763-7680","authenticated-orcid":false,"given":"Jens","family":"Goemaere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8984-2463","authenticated-orcid":false,"given":"Jan","family":"Goedgebeur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,7]]},"reference":[{"key":"1410_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101312","volume":"79","author":"A Amirteimoori","year":"2023","unstructured":"Amirteimoori A, Tirkolaee EB, Simic V, Weber G-W (2023) A parallel heuristic for hybrid job shop scheduling problem considering conflict-free AGV routing. Swarm Evol Comput 79:101312","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"1410_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s11750-007-0015-2","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Rejoinder on: Static pickup and delivery problems: a classification scheme and survey. TOP 15(1):45\u201347","journal-title":"TOP"},{"issue":"4","key":"1410_CR3","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1287\/trsc.2014.0535","volume":"49","author":"M Cherkesly","year":"2015","unstructured":"Cherkesly M, Desaulniers G, Laporte G (2015) Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Transp Sci 49(4):752\u2013766","journal-title":"Transp Sci"},{"issue":"1","key":"1410_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/net.20312","volume":"55","author":"J-F Cordeau","year":"2010","unstructured":"Cordeau J-F, Iori M, Laporte G, Salazar Gonz\u00e1lez JJ (2010) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading. Networks 55(1):46\u201359","journal-title":"Networks"},{"issue":"6","key":"1410_CR5","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1016\/j.cor.2005.07.004","volume":"34","author":"AI Corr\u00e9a","year":"2007","unstructured":"Corr\u00e9a AI, Langevin A, Rousseau L-M (2007) Scheduling and routing of automated guided vehicles: A hybrid approach. Comput Oper Res 34(6):1688\u20131707","journal-title":"Comput Oper Res"},{"issue":"4","key":"1410_CR6","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1002\/net.21459","volume":"60","author":"J-F C\u00f4t\u00e9","year":"2012","unstructured":"C\u00f4t\u00e9 J-F, Archetti C, Speranza MG, Gendreau M, Potvin J-Y (2012) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4):212\u2013226","journal-title":"Networks"},{"key":"1410_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106999","volume":"152","author":"M Dr\u00f3tos","year":"2021","unstructured":"Dr\u00f3tos M, Gy\u00f6rgyi P, Horv\u00e1th M, Kis T (2021) Suboptimal and conflict-free control of a fleet of AGVs to serve online requests. Comput Ind Eng 152:106999","journal-title":"Comput Ind Eng"},{"key":"1410_CR8","doi-asserted-by":"crossref","unstructured":"Fazlollahtabar H, Saidi-mehrabad M (2015) Methodologies to optimize automated guided vehicle scheduling and routing problems: A review study. Journal of Intelligent and Robotic Systems, 77 (3\u20134):525\u2013545, 03. URL https:\/\/www.proquest.com\/scholarly-journals\/methodologies-optimize-automated-guided-vehicle\/docview\/1660317506\/se-2. Copyright - Springer Science+Business Media Dordrecht 2015; Last updated - 2015\u201303-06","DOI":"10.1007\/s10846-013-0003-8"},{"issue":"9\u201312","key":"1410_CR9","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1007\/s00170-010-2700-9","volume":"51","author":"H Fazlollahtabar","year":"2010","unstructured":"Fazlollahtabar H, Rezaie B, Kalantari H (2010) Mathematical programming approach to optimize material flow in an AGV-based flexible jobshop manufacturing system with performance analysis. Int J Adv Manuf Technol 51(9\u201312):1149\u20131158","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"1410_CR10","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1108\/IR-12-2014-0437","volume":"42","author":"H Fazlollahtabar","year":"2015","unstructured":"Fazlollahtabar H, Saidi-Mehrabad M, Masehian E (2015) Mathematical model for deadlock resolution in multiple AGV scheduling and routing network: a case study. Ind Robot 42(3):252\u2013263","journal-title":"Ind Robot"},{"key":"1410_CR11","unstructured":"Forrest J, Ralphs T, Santos HG, Vigerske S, Forrest J, Hafer L, Kristjansson B (2023) jpfasano, EdwinStraver, M. Lubin, et al. coin-or\/cbc: Release releases\/2.10.10. doi: 10.5281\/zenodo.7843975"},{"issue":"5","key":"1410_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533\u2013549","journal-title":"Comput Oper Res"},{"issue":"5","key":"1410_CR13","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s00170-005-2529-9","volume":"29","author":"J Jerald","year":"2006","unstructured":"Jerald J, Asokan P, Saravanan R, Rani ADC (2006) Simultaneous scheduling of parts and automated guided vehicles in an FMS environment using adaptive genetic algorithm. Int J Adv Manuf Technol 29(5):584\u2013589","journal-title":"Int J Adv Manuf Technol"},{"issue":"54","key":"1410_CR14","first-page":"1","volume":"23","author":"M Lindauer","year":"2022","unstructured":"Lindauer M, Eggensperger K, Feurer M, Biedenkapp A, Deng D, Benjamins C, Ruhkopf T, Sass R, Hutter F (2022) SMAC3: A versatile bayesian optimization package for hyperparameter optimization. J Mach Learn Res 23(54):1\u20139","journal-title":"J Mach Learn Res"},{"key":"1410_CR15","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.cie.2018.10.002","volume":"126","author":"W Malopolski","year":"2018","unstructured":"Malopolski W (2018) A sustainable and conflict-free operation of AGVs in a square topology. Comput Ind Eng 126:472\u2013481","journal-title":"Comput Ind Eng"},{"key":"1410_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2015.10.017","volume":"91","author":"T Miyamoto","year":"2016","unstructured":"Miyamoto T, Inoue K (2016) Local and random searches for dispatch and conflict-free routing problem of capacitated AGV systems. Comput Ind Eng 91:1\u20139","journal-title":"Comput Ind Eng"},{"key":"1410_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106270","volume":"141","author":"K Murakami","year":"2020","unstructured":"Murakami K (2020) Time-space network model and MILP formulation of the conflict-free routing problem of a capacitated AGV system. Comput Ind Eng 141:106270. https:\/\/doi.org\/10.1016\/j.cie.2020.106270","journal-title":"Comput Ind Eng"},{"issue":"5","key":"1410_CR18","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.cor.2010.08.012","volume":"38","author":"T Nishi","year":"2011","unstructured":"Nishi T, Hiranaka Y, Grossmann IE (2011) A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles. Comput Oper Res 38(5):876\u2013888","journal-title":"Comput Oper Res"},{"issue":"9","key":"1410_CR19","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1080\/002075499190888","volume":"37","author":"C Oboth","year":"1999","unstructured":"Oboth C, Batta R, Karwan M (1999) Dynamic conflict-free routing of automated guided vehicles. Int J Prod Res 37(9):2003\u20132030","journal-title":"Int J Prod Res"},{"issue":"3","key":"1410_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/net.22096","volume":"80","author":"D Radha Krishnan","year":"2022","unstructured":"Radha Krishnan D, Liu T (2022) A branch-and-cut algorithm for the pickup-and-delivery traveling salesman problem with handling costs. Networks 80(3):297\u2013313","journal-title":"Networks"},{"key":"1410_CR21","doi-asserted-by":"crossref","unstructured":"Rashidi H, Tsang EP (2011) A complete and an incomplete algorithm for automated guided vehicle","DOI":"10.1016\/j.camwa.2010.12.009"},{"issue":"3\u20134","key":"1410_CR22","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00170-007-1094-9","volume":"38","author":"R Tavakkoli-Moghaddam","year":"2008","unstructured":"Tavakkoli-Moghaddam R, Aryanezhad MB, Kazemipoor H, Salehipour A (2008) Partitioning machines in tandem AGV systems based on \u201cbalanced flow strategy\u2019\u2019 by simulated annealing. Int J Adv Manuf Technol 38(3\u20134):355\u2013366","journal-title":"Int J Adv Manuf Technol"},{"key":"1410_CR23","unstructured":"Thanos E, Wauters T, Vanden Berghe G (2021) Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation"},{"issue":"19","key":"1410_CR24","doi-asserted-by":"publisher","first-page":"5748","DOI":"10.1080\/00207543.2014.910628","volume":"52","author":"Y Zheng","year":"2014","unstructured":"Zheng Y, Xiao Y, Seo Y (2014) A tabu search algorithm for simultaneous machine\/AGV scheduling problem. Int J Prod Res 52(19):5748\u20135763","journal-title":"Int J Prod Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01410-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01410-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01410-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:59:33Z","timestamp":1774724373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01410-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1410"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01410-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"11 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2026","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 relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"30"}}