{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T16:54:59Z","timestamp":1773680099025,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["IR 122\/7-2"],"award-info":[{"award-number":["IR 122\/7-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCHN 1497\/1-2"],"award-info":[{"award-number":["SCHN 1497\/1-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10479-025-06960-7","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T15:04:18Z","timestamp":1770649458000},"page":"1091-1139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rule-based design of a granular tabu search for the multi-depot vehicle routing problem"],"prefix":"10.1007","volume":"358","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2956-2771","authenticated-orcid":false,"given":"Christian","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rossana","family":"Cavagnini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,9]]},"reference":[{"issue":"5","key":"6960_CR1","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1287\/trsc.2019.0943","volume":"54","author":"L Accorsi","year":"2020","unstructured":"Accorsi, L., & Vigo, D. (2020). A hybrid metaheuristic for single truck and trailer routing problems. Transportation Science, 54(5), 1351\u20131371.","journal-title":"Transportation Science"},{"issue":"2","key":"6960_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci, R., & Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming, 120(2), 347\u2013380.","journal-title":"Mathematical Programming"},{"issue":"1","key":"6960_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1111\/j.1540-5915.1983.tb00172.x","volume":"14","author":"MO Ball","year":"1983","unstructured":"Ball, M. O., Golden, B., Assad, A., & Bodin, L. (1983). Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences, 14(1), 103\u2013120.","journal-title":"Decision Sciences"},{"key":"6960_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.dam.2022.12.019","volume":"329","author":"C Becker","year":"2023","unstructured":"Becker, C., Gauthier, J. B., Gschwind, T., & Schneider, M. (2023). In-depth analysis of granular local search for capacitated vehicle routing. Discrete Applied Mathematics, 329, 61\u201386.","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"6960_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/inte.13.6.4","volume":"13","author":"WJ Bell","year":"1983","unstructured":"Bell, W. J., Dalberto, L. M., Fisher, M. L., Greenfield, A. J., Jaikumar, R., Kedia, P., Mack, R. G., & Prutzman, P. J. (1983). Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces, 13(6), 4\u201323.","journal-title":"Interfaces"},{"issue":"1","key":"6960_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/inte.17.1.107","volume":"17","author":"GG Brown","year":"1987","unstructured":"Brown, G. G., Ellis, C. J., Graves, G. W., & Ronen, D. (1987). Real-time, wide area dispatch of mobil tank trucks. Interfaces, 17(1), 107\u2013120.","journal-title":"Interfaces"},{"issue":"2","key":"6960_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1057\/jors.1972.26","volume":"23","author":"P Cassidy","year":"1972","unstructured":"Cassidy, P., & Bennett, H. (1972). Tramp-a multi-depot vehicle scheduling system. Journal of the Operational Research Society, 23(2), 151\u2013163.","journal-title":"Journal of the Operational Research Society"},{"issue":"3\u20134","key":"6960_CR8","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1080\/01966324.1993.10737363","volume":"13","author":"I-M Chao","year":"1993","unstructured":"Chao, I.-M., Golden, B. L., & Wasil, E. (1993). A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. American Journal of Mathematical and Management Sciences, 13(3\u20134), 371\u2013406.","journal-title":"American Journal of Mathematical and Management Sciences"},{"issue":"2","key":"6960_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/trsc.2019.0914","volume":"54","author":"J Christiaens","year":"2020","unstructured":"Christiaens, J., & Vanden Berghe, G. (2020). Slack induction by string removals for vehicle routing problems. Transportation Science, 54(2), 417\u2013433.","journal-title":"Transportation Science"},{"issue":"3","key":"6960_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle-dispatching problem. Journal of the Operational Research Society, 20(3), 309\u2013318.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"6960_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/ijoc.12.1.24.11899","volume":"12","author":"M Coffin","year":"2000","unstructured":"Coffin, M., & Saltzman, M. J. (2000). Statistical analysis of computational tests of algorithms and heuristics. INFORMS Journal on Computing, 12(1), 24\u201344.","journal-title":"INFORMS Journal on Computing"},{"key":"6960_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo, C., & Martinelli, R. (2014). A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimization, 12, 129\u2013146.","journal-title":"Discrete Optimization"},{"issue":"2","key":"6960_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J-F Cordeau","year":"1997","unstructured":"Cordeau, J.-F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30(2), 105\u2013119.","journal-title":"Networks"},{"issue":"8","key":"6960_CR14","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational research society, 52(8), 928\u2013936.","journal-title":"Journal of the Operational research society"},{"key":"6960_CR15","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., & Maischberger, M. (2012). A parallel iterated tabu search heuristic for vehicle routing problems. Computers Operations Research 39(9), 2033\u20132050.","DOI":"10.1016\/j.cor.2011.09.021"},{"key":"6960_CR16","unstructured":"De Smet, G., & Wauters, T. (2020) Multithreaded incremental solving for local search based metaheuristics with step chasing. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021: Volume I, pages 87\u2013104,"},{"key":"6960_CR17","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.trb.2014.05.014","volume":"67","author":"JW Escobar","year":"2014","unstructured":"Escobar, J. W., Linfati, R., Baldoquin, M. G., & Toth, P. (2014). A granular variable tabu neighborhood search for the capacitated location-routing problem. Transportation Research Part B: Methodological, 67, 344\u2013356.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"5","key":"6960_CR18","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10732-014-9247-0","volume":"20","author":"JW Escobar","year":"2014","unstructured":"Escobar, J. W., Linfati, R., Toth, P., & Baldoquin, M. G. (2014). A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. Journal of Heuristics, 20(5), 483\u2013509.","journal-title":"Journal of Heuristics"},{"key":"6960_CR19","doi-asserted-by":"crossref","unstructured":"Fisher, M. L., Greenfield, A. J., Jaikumar, R., Lester, J. T., & III. (1982). A computerized vehicle routing application. Interfaces, 12(4), 42\u201352.","DOI":"10.1287\/inte.12.4.42"},{"issue":"4","key":"6960_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10732-005-1997-2","volume":"11","author":"B Funke","year":"2005","unstructured":"Funke, B., Gr\u00fcnert, T., & Irnich, S. (2005). Local search for vehicle routing and scheduling problems: Review and conceptual integration. Journal of Heuristics, 11(4), 267\u2013306.","journal-title":"Journal of Heuristics"},{"key":"6960_CR21","unstructured":"Gauthier, J.B. & Irnich, S.: Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems. Technical Report LM-2020-03, Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, Mainz, Germany, (2020)"},{"key":"6960_CR22","doi-asserted-by":"crossref","unstructured":"Gendreau, M. (2003). An introduction to tabu search. In F.\u00a0Glover and G.\u00a0A. Kochenberger, editors, Handbook of Metaheuristics, pages 37\u201354. Springer US, Boston, MA, ISBN 978-0-306-48056-0.","DOI":"10.1007\/0-306-48056-5_2"},{"issue":"10","key":"6960_CR23","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management science, 40(10), 1276\u20131290.","journal-title":"Management science"},{"issue":"6","key":"6960_CR24","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","volume":"4","author":"BE Gillett","year":"1976","unstructured":"Gillett, B. E., & Johnson, J. G. (1976). Multi-terminal vehicle-dispatch algorithm. Omega, 4(6), 711\u2013718.","journal-title":"Omega"},{"issue":"3","key":"6960_CR25","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search-part I. ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"6960_CR26","doi-asserted-by":"crossref","unstructured":"Gutierrez, A., Dieulle, L., Labadie, N., & Velasco, N. (2018). A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands. Computers Operations Research, 99, 135\u2013147.","DOI":"10.1016\/j.cor.2018.06.012"},{"key":"6960_CR27","doi-asserted-by":"crossref","unstructured":"Hesam Sadati, M. E., \u00c7atay, B., & Aksen, D. (2021). An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems. Comput. Oper. Res., 133, Article 105269.","DOI":"10.1016\/j.cor.2021.105269"},{"key":"6960_CR28","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.trb.2013.07.014","volume":"56","author":"D Kirchler","year":"2013","unstructured":"Kirchler, D., & Wolfler Calvo, R. (2013). A granular tabu search algorithm for the dial-a-ride problem. Transportation Research Part B: Methodological, 56, 120\u2013135.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"6960_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2012.01.030","volume":"220","author":"N Labadie","year":"2012","unstructured":"Labadie, N., Mansini, R., Melechovsk\u00fd, J., & Wolfler Calvo, R. (2012). The team orienteering problem with time windows: An LP-based granular variable neighborhood search. European Journal of Operational Research, 220(1), 15\u201327.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6960_CR30","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1109\/TASE.2009.2019265","volume":"7","author":"HC Lau","year":"2009","unstructured":"Lau, H. C., Chan, T., Tsui, W., & Pang, W. (2009). Application of genetic algorithms to solve the multidepot vehicle routing problem. IEEE Transactions on Automation Science and Engineering, 7(2), 383\u2013392.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"6960_CR31","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2014.03.004","volume":"72","author":"J Luo","year":"2014","unstructured":"Luo, J., & Chen, M.-R. (2014). Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the mdvrp and the mdvrptw. Computers Industrial Engineering, 72, 84\u201397.","journal-title":"Computers Industrial Engineering"},{"key":"6960_CR32","doi-asserted-by":"crossref","unstructured":"Ombuki-Berman, B., & Hanshar, F.\u00a0T. (2009). Using genetic algorithms for multi-depot vehicle routing. In F.\u00a0B. Pereira and J.\u00a0Tavares, editors, Bio-inspired Algorithms for the Vehicle Routing Problem, pages 77\u201399. Springer Berlin Heidelberg, Berlin, Heidelberg, ISBN 978-3-540-85152-3.","DOI":"10.1007\/978-3-540-85152-3_4"},{"issue":"8","key":"6960_CR33","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers Operations Research, 34(8), 2403\u20132435.","journal-title":"Computers Operations Research"},{"issue":"4","key":"6960_CR34","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/inte.24.4.113","volume":"24","author":"J Pooley","year":"1994","unstructured":"Pooley, J. (1994). Integrated production and distribution facility planning at ault foods. Interfaces, 24(4), 113\u2013121.","journal-title":"Interfaces"},{"issue":"4","key":"6960_CR35","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/trsc.1060.0187","volume":"41","author":"C Prins","year":"2007","unstructured":"Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Wolfler Calvo, R. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 41(4), 470\u2013483.","journal-title":"Transportation Science"},{"issue":"3","key":"6960_CR36","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.ejor.2017.10.029","volume":"266","author":"S Reil","year":"2018","unstructured":"Reil, S., Bortfeldt, A., & M\u00f6nch, L. (2018). Heuristics for vehicle routing problems with backhauls, time windows, and 3d loading constraints. European Journal of Operational Research, 266(3), 877\u2013894.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6960_CR37","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J Renaud","year":"1996","unstructured":"Renaud, J., Laporte, G., & Boctor, F. F. (1996). A tabu search heuristic for the multi-depot vehicle routing problem. Computers Operations Research, 23(3), 229\u2013235.","journal-title":"Computers Operations Research"},{"issue":"1","key":"6960_CR38","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/trsc.2020.0985","volume":"55","author":"R Sadykov","year":"2021","unstructured":"Sadykov, R., Uchoa, E., & Pessoa, A. (2021). A bucket graph-based labeling algorithm with application to vehicle routing. Transportation Science, 55(1), 4\u201328.","journal-title":"Transportation Science"},{"issue":"1","key":"6960_CR39","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1287\/trsc.2017.0770","volume":"53","author":"M Schneider","year":"2019","unstructured":"Schneider, M., & L\u00f6ffler, M. (2019). Large composite neighborhoods for the capacitated location-routing problem. Transportation Science, 53(1), 301\u2013318.","journal-title":"Transportation Science"},{"issue":"2","key":"6960_CR40","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.ejor.2017.04.059","volume":"263","author":"M Schneider","year":"2017","unstructured":"Schneider, M., Schwahn, F., & Vigo, D. (2017). Designing granular solution methods for routing problems with time windows. European Journal of Operational Research, 263(2), 493\u2013509.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"6960_CR41","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian, A., Uchoa, E., & Ochi, L. S. (2013). A hybrid algorithm for a class of vehicle routing problems. Computers Operations Research, 40(10), 2519\u20132531.","journal-title":"Computers Operations Research"},{"issue":"4","key":"6960_CR42","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1080\/08839510151087293","volume":"15","author":"SR Thangiah","year":"2001","unstructured":"Thangiah, S. R., & Salhi, S. (2001). Genetic clustering: An adaptive heuristic for the multidepot vehicle routing problem. Applied Artificial Intelligence, 15(4), 361\u2013383.","journal-title":"Applied Artificial Intelligence"},{"key":"6960_CR43","doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D. (Eds.). (2002). The Vehicle Routing Problem. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics. , 0-89871-498-2","DOI":"10.1137\/1.9780898718515"},{"issue":"4","key":"6960_CR44","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth, P., & Vigo, D. (2003). The granular tabu search and its application to the vehicle-routing problem. Informs Journal on Computing, 15(4), 333\u2013346.","journal-title":"Informs Journal on Computing"},{"issue":"3","key":"6960_CR45","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012). A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Operations Research, 60(3), 611\u2013624.","journal-title":"Operations Research"},{"key":"6960_CR46","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers Operations Research, 40, 475\u2013489.","journal-title":"Computers Operations Research"},{"issue":"1","key":"6960_CR47","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2013.12.044","volume":"237","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). Implicit depot assignments and rotations in vehicle routing heuristics. European Journal of Operational Research, 237(1), 15\u201328.","journal-title":"European Journal of Operational Research"},{"key":"6960_CR48","unstructured":"Vigo, D., & Toth, P. (Eds.). (2014). Vehicle Routing. Philadelphia, PA: MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics. , 978-1-61197-358-7"},{"key":"6960_CR49","doi-asserted-by":"crossref","unstructured":"Voigt, S., Frank, M., Fontaine, P., & Kuhn, H. (2022). Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions. Computers & Operations Research 146, Article 105856.","DOI":"10.1016\/j.cor.2022.105856"},{"issue":"6","key":"6960_CR50","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80\u201383.","journal-title":"Biometrics Bulletin"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06960-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06960-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06960-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T16:06:16Z","timestamp":1773677176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06960-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,9]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["6960"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06960-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,9]]},"assertion":[{"value":"10 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 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":"Author Christian Becker declares that he has no conflict of interest. Author Rossana Cavagnini declares that she has no conflict of interest. Author Stefan Irnich declares that he has no conflict of interest. Author Michael Schneider declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}