{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T12:05:07Z","timestamp":1783512307504,"version":"3.55.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"9-10","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72371093"],"award-info":[{"award-number":["72371093"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72071056"],"award-info":[{"award-number":["72071056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10489-024-05532-9","type":"journal-article","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T13:03:06Z","timestamp":1716901386000},"page":"6865-6887","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A deep reinforcement learning hyper-heuristic to solve order batching problem with mobile robots"],"prefix":"10.1007","volume":"54","author":[{"given":"Bayi","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lingjun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qi","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,28]]},"reference":[{"issue":"2","key":"5532_CR1","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.ejor.2020.01.022","volume":"284","author":"C Arbex Valle","year":"2020","unstructured":"Arbex Valle C, Beasley JE (2020) Order batching using an approximation for the distance travelled by pickers. Eur J Oper Res 284(2):460\u2013484. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.022","journal-title":"Eur J Oper Res"},{"issue":"2","key":"5532_CR2","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2018.08.023","volume":"277","author":"N Boysen","year":"2019","unstructured":"Boysen N, De Koster R, Weidinger F (2019) Warehousing in the e-commerce era: a survey. Eur J Oper Res 277(2):396\u2013411. https:\/\/doi.org\/10.1016\/j.ejor.2018.08.023","journal-title":"Eur J Oper Res"},{"issue":"2","key":"5532_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.ejor.2020.01.059","volume":"285","author":"O Briant","year":"2020","unstructured":"Briant O, Cambazard H, Cattaruzza D et al (2020) An efficient and general approach for the joint order batching and picker routing problem. Eur J Oper Res 285(2):497\u2013512. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.059","journal-title":"Eur J Oper Res"},{"key":"5532_CR4","doi-asserted-by":"publisher","first-page":"107221","DOI":"10.1016\/j.cie.2021.107221","volume":"156","author":"B Cals","year":"2021","unstructured":"Cals B, Zhang Y, Dijkman R et al (2021) Solving the online batching problem using deep reinforcement learning. Comput Ind Eng 156:107221. https:\/\/doi.org\/10.1016\/j.cie.2021.107221","journal-title":"Comput Ind Eng"},{"issue":"1","key":"5532_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10845-016-1248-4","volume":"30","author":"C Cergibozan","year":"2019","unstructured":"Cergibozan C, Tasan AS (2019) Order batching operations: an overview of classification, solution techniques, and future research. J Intell Manuf 30(1):335\u2013349. https:\/\/doi.org\/10.1007\/s10845-016-1248-4","journal-title":"J Intell Manuf"},{"issue":"1","key":"5532_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10845-020-01653-3","volume":"33","author":"C Cergibozan","year":"2022","unstructured":"Cergibozan C, Tasan AS (2022) Genetic algorithm based approaches to solve the order batching problem and a case study in a distribution center. J Intell Manuf 33(1):137\u2013149. https:\/\/doi.org\/10.1007\/s10845-020-01653-3","journal-title":"J Intell Manuf"},{"key":"5532_CR7","doi-asserted-by":"publisher","first-page":"114174","DOI":"10.1016\/j.eswa.2020.114174","volume":"167","author":"H Chen","year":"2021","unstructured":"Chen H, Ding G, Qin S et al (2021) A hyper-heuristic based ensemble genetic programming approach for stochastic resource constrained project scheduling problem. Expert Syst Appl 167:114174. https:\/\/doi.org\/10.1016\/j.eswa.2020.114174","journal-title":"Expert Syst Appl"},{"key":"5532_CR8","doi-asserted-by":"publisher","first-page":"103729","DOI":"10.1016\/j.robot.2021.103729","volume":"137","author":"IR Da Costa Barros","year":"2021","unstructured":"Da Costa Barros IR, Nascimento TP (2021) Robotic Mobile Fulfillment Systems: a survey on recent developments and research opportunities. Robot Auton Syst 137:103729. https:\/\/doi.org\/10.1016\/j.robot.2021.103729","journal-title":"Robot Auton Syst"},{"key":"5532_CR9","doi-asserted-by":"publisher","first-page":"109815","DOI":"10.1016\/j.cie.2023.109815","volume":"187","author":"T Dokeroglu","year":"2024","unstructured":"Dokeroglu T, Kucukyilmaz T, Talbi EG (2024) Hyper-heuristics: a survey and taxonomy. Comp Ind Eng 187:109815. https:\/\/doi.org\/10.1016\/j.cie.2023.109815","journal-title":"Comp Ind Eng"},{"issue":"2","key":"5532_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","volume":"285","author":"JH Drake","year":"2020","unstructured":"Drake JH, Kheiri A, Ozcan E et al (2020) Recent advances in selection hyper-heuristics. Eur J Oper Res 285(2):405\u2013428. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.073","journal-title":"Eur J Oper Res"},{"key":"5532_CR11","doi-asserted-by":"publisher","first-page":"107365","DOI":"10.1016\/j.cie.2021.107365","volume":"158","author":"G Duan","year":"2021","unstructured":"Duan G, Zhang C, Gonzalez P et al (2021) Performance evaluation for robotic mobile fulfillment systems with time-varying arrivals. Comp Ind Eng 158:107365. https:\/\/doi.org\/10.1016\/j.cie.2021.107365","journal-title":"Comp Ind Eng"},{"key":"5532_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.knosys.2019.02.010","volume":"172","author":"MA Elaziz","year":"2019","unstructured":"Elaziz MA, Mirjalili S (2019) A hyper-heuristic for improving the initial population of whale optimization algorithm. Knowl-Based Syst 172:42\u201363. https:\/\/doi.org\/10.1016\/j.knosys.2019.02.010","journal-title":"Knowl-Based Syst"},{"key":"5532_CR13","doi-asserted-by":"publisher","first-page":"102087","DOI":"10.1016\/j.tre.2020.102087","volume":"142","author":"A Gharehgozli","year":"2020","unstructured":"Gharehgozli A, Zaerpour N (2020) Robot scheduling for pod retrieval in a robotic mobile fulfillment system. Trans Res Part E Log Trans Rev 142:102087. https:\/\/doi.org\/10.1016\/j.tre.2020.102087","journal-title":"Trans Res Part E Log Trans Rev"},{"issue":"2","key":"5532_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10898-020-00910-2","volume":"78","author":"S Gil-Borras","year":"2020","unstructured":"Gil-Borras S, Pardo EG, Alonso-Ayuso A et al (2020) GRASP with variable neighborhood descent for the online order batching problem. J Global Optim 78(2):295\u2013325. https:\/\/doi.org\/10.1007\/s10898-020-00910-2","journal-title":"J Global Optim"},{"key":"5532_CR15","doi-asserted-by":"publisher","first-page":"107517","DOI":"10.1016\/j.cie.2021.107517","volume":"160","author":"S Gil-Borras","year":"2021","unstructured":"Gil-Borras S, Pardo EG, Alonso-Ayuso A et al (2021) A heuristic approach for the online order batching problem with multiple pickers. Comp Ind Eng 160:107517. https:\/\/doi.org\/10.1016\/j.cie.2021.107517","journal-title":"Comp Ind Eng"},{"key":"5532_CR16","doi-asserted-by":"publisher","unstructured":"Gil-Borras S, Pardo EG, Jimenez E et al (2023) The time-window strategy in the online order batching problem. Int J Prod Res 1\u201324. https:\/\/doi.org\/10.1080\/00207543.2023.2263884","DOI":"10.1080\/00207543.2023.2263884"},{"issue":"16","key":"5532_CR17","doi-asserted-by":"publisher","first-page":"5032","DOI":"10.1080\/00207543.2020.1779370","volume":"59","author":"Y Gong","year":"2021","unstructured":"Gong Y, Jin M, Yuan Z (2021) Robotic mobile fulfilment systems considering customer classes. Int J Prod Res 59(16):5032\u20135049. https:\/\/doi.org\/10.1080\/00207543.2020.1779370","journal-title":"Int J Prod Res"},{"issue":"18","key":"5532_CR18","doi-asserted-by":"publisher","first-page":"12997","DOI":"10.1007\/s00500-022-07118-4","volume":"27","author":"F Guerriero","year":"2023","unstructured":"Guerriero F, Saccomanno FP (2023) A hierarchical hyper-heuristic for the bin packing problem. Soft Comput 27(18):12997\u201313010. https:\/\/doi.org\/10.1007\/s00500-022-07118-4","journal-title":"Soft Comput"},{"key":"5532_CR19","doi-asserted-by":"publisher","first-page":"108856","DOI":"10.1016\/j.cie.2022.108856","volume":"175","author":"G Jiao","year":"2023","unstructured":"Jiao G, Li H, Huang M (2023) Online joint optimization of pick order assignment and pick pod selection in robotic mobile fulfillment systems. Comp Ind Eng 175:108856. https:\/\/doi.org\/10.1016\/j.cie.2022.108856","journal-title":"Comp Ind Eng"},{"issue":"2514\/1","key":"5532_CR20","doi-asserted-by":"publisher","first-page":"I011048","DOI":"10.2514\/1.I011048","volume":"10","author":"P Juntama","year":"2022","unstructured":"Juntama P, Delahaye D, Chaimatanan S et al (2022) Hyperheuristic approach based on reinforcement learning for air traffic complexity mitigation. J Aero Inf Sys 10(2514\/1):I011048. https:\/\/doi.org\/10.2514\/1.I011048","journal-title":"J Aero Inf Sys"},{"key":"5532_CR21","doi-asserted-by":"publisher","first-page":"102897","DOI":"10.1016\/j.omega.2023.102897","volume":"120","author":"JE Justkowiak","year":"2023","unstructured":"Justkowiak JE, Pesch E (2023) A column generation driven heuristic for order-scheduling and rack-sequencing in robotic mobile fulfillment systems. Omega 120:102897. https:\/\/doi.org\/10.1016\/j.omega.2023.102897","journal-title":"Omega"},{"issue":"3","key":"5532_CR22","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1016\/j.ejor.2022.06.051","volume":"305","author":"JE Justkowiak","year":"2023","unstructured":"Justkowiak JE, Pesch E (2023) Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems. Eur J Oper Res 305(3):1063\u20131078. https:\/\/doi.org\/10.1016\/j.ejor.2022.06.051","journal-title":"Eur J Oper Res"},{"key":"5532_CR23","doi-asserted-by":"publisher","first-page":"105221","DOI":"10.1016\/j.cor.2021.105221","volume":"130","author":"A Kheiri","year":"2021","unstructured":"Kheiri A, Gretsista A, Keedwell E et al (2021) A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem. Comp Oper Res 130:105221. https:\/\/doi.org\/10.1016\/j.cor.2021.105221","journal-title":"Comp Oper Res"},{"issue":"11","key":"5532_CR24","doi-asserted-by":"publisher","first-page":"5235","DOI":"10.3390\/s23115235","volume":"23","author":"Y Kim","year":"2023","unstructured":"Kim Y, Kim DW, Kang BY (2023) Table-balancing cooperative robot based on deep reinforcement learning. Sensors 23(11):5235. https:\/\/doi.org\/10.3390\/s23115235","journal-title":"Sensors"},{"issue":"6","key":"5532_CR25","doi-asserted-by":"publisher","first-page":"4909","DOI":"10.1109\/TITS.2021.3054625","volume":"23","author":"BR Kiran","year":"2022","unstructured":"Kiran BR, Sobh I, Talpaert V et al (2022) Deep reinforcement learning for autonomous driving: a survey. IEEE Trans Intell Transp Syst 23(6):4909\u20134926. https:\/\/doi.org\/10.1109\/TITS.2021.3054625","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"5532_CR26","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1111\/coin.12325","volume":"38","author":"M Lassouaoui","year":"2022","unstructured":"Lassouaoui M, Boughaci D, Benhamou B (2022) A synergy Thompson sampling hyper-heuristic for the feature selection problem. Comput Intell 38(3):1083\u20131105. https:\/\/doi.org\/10.1111\/coin.12325","journal-title":"Comput Intell"},{"key":"5532_CR27","doi-asserted-by":"publisher","first-page":"115978","DOI":"10.1016\/j.eswa.2021.115978","volume":"187","author":"J Lin","year":"2022","unstructured":"Lin J, Li YY, Song HB (2022) Semiconductor final testing scheduling using Q-learning based hyper-heuristic. Expert Syst Appl 187:115978. https:\/\/doi.org\/10.1016\/j.eswa.2021.115978","journal-title":"Expert Syst Appl"},{"issue":"4","key":"5532_CR28","doi-asserted-by":"publisher","first-page":"4372","DOI":"10.1109\/TVT.2022.3228198","volume":"72","author":"D Liu","year":"2023","unstructured":"Liu D, Dou L, Zhang R et al (2023) Multi-agent reinforcement learning-based coordinated dynamic task allocation for heterogenous UAVs. IEEE Trans Veh Technol 72(4):4372\u20134383. https:\/\/doi.org\/10.1109\/TVT.2022.3228198","journal-title":"IEEE Trans Veh Technol"},{"key":"5532_CR29","doi-asserted-by":"publisher","first-page":"107489","DOI":"10.1016\/j.cie.2021.107489","volume":"159","author":"S Luo","year":"2021","unstructured":"Luo S, Zhang L, Fan Y (2021) Dynamic multi-objective scheduling for flexible job shop by deep reinforcement learning. Comp Ind Eng 159:107489. https:\/\/doi.org\/10.1016\/j.cie.2021.107489","journal-title":"Comp Ind Eng"},{"key":"5532_CR30","doi-asserted-by":"publisher","first-page":"109190","DOI":"10.1016\/j.knosys.2022.109190","volume":"251","author":"S Mahmud","year":"2022","unstructured":"Mahmud S, Abbasi A, Chakrabortty RK et al (2022) A self-adaptive hyper-heuristic based multi-objective optimisation approach for integrated supply chain scheduling problems. Knowl-Based Syst 251:109190. https:\/\/doi.org\/10.1016\/j.knosys.2022.109190","journal-title":"Knowl-Based Syst"},{"key":"5532_CR31","doi-asserted-by":"publisher","first-page":"102204","DOI":"10.1016\/j.omega.2020.102204","volume":"99","author":"L Polten","year":"2021","unstructured":"Polten L, Emde S (2021) Scheduling automated guided vehicles in very narrow aisle warehouses. Omega 99:102204. https:\/\/doi.org\/10.1016\/j.omega.2020.102204","journal-title":"Omega"},{"key":"5532_CR32","doi-asserted-by":"publisher","first-page":"107252","DOI":"10.1016\/j.cie.2021.107252","volume":"156","author":"W Qin","year":"2021","unstructured":"Qin W, Zhuang Z, Huang Z et al (2021) A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem. Comp Ind Eng 156:107252. https:\/\/doi.org\/10.1016\/j.cie.2021.107252","journal-title":"Comp Ind Eng"},{"issue":"1","key":"5532_CR33","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TETCI.2022.3174915","volume":"7","author":"Z Shao","year":"2023","unstructured":"Shao Z, Shao W, Pi D (2023) LS-HH: a learning-based selection hyper-heuristic for distributed heterogeneous hybrid blocking flow-shop scheduling. IEEE Trans Emerg Top Comput Intell 7(1):111\u2013127. https:\/\/doi.org\/10.1109\/TETCI.2022.3174915","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"issue":"2","key":"5532_CR34","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ejor.2022.03.056","volume":"304","author":"S Wagner","year":"2023","unstructured":"Wagner S, Mnch L (2023) A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices. Eur J Oper Res 304(2):461\u2013475. https:\/\/doi.org\/10.1016\/j.ejor.2022.03.056","journal-title":"Eur J Oper Res"},{"issue":"3","key":"5532_CR35","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/trsc.2023.1198","volume":"57","author":"J Wahlen","year":"2023","unstructured":"Wahlen J, Gschwind T (2023) Branch-price-and-cut-based solution of order batching problems. Transp Sci 57(3):756\u2013777. https:\/\/doi.org\/10.1287\/trsc.2023.1198","journal-title":"Transp Sci"},{"issue":"14","key":"5532_CR36","doi-asserted-by":"publisher","first-page":"4367","DOI":"10.1080\/00207543.2019.1652778","volume":"58","author":"K Wang","year":"2020","unstructured":"Wang K, Yang Y, Li R (2020) Travel time models for the rack-moving mobile robot system. Int J Prod Res 58(14):4367\u20134385. https:\/\/doi.org\/10.1080\/00207543.2019.1652778","journal-title":"Int J Prod Res"},{"key":"5532_CR37","doi-asserted-by":"publisher","first-page":"108229","DOI":"10.1016\/j.cie.2022.108229","volume":"169","author":"K Wang","year":"2022","unstructured":"Wang K, Hu T, Wang Z et al (2022) Performance evaluation of a robotic mobile fulfillment system with multiple picking stations under zoning policy. Comp Ind Eng 169:108229. https:\/\/doi.org\/10.1016\/j.cie.2022.108229","journal-title":"Comp Ind Eng"},{"key":"5532_CR38","doi-asserted-by":"publisher","unstructured":"Xia W, Hongwei G, Mingde Z et al (2023) Stochastic online decisioning hyper-heuristic for high dimensional optimization. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-023-05185-0","DOI":"10.1007\/s10489-023-05185-0"},{"issue":"1","key":"5532_CR39","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ejor.2020.05.032","volume":"288","author":"L Xie","year":"2021","unstructured":"Xie L, Thieme N, Krenzler R et al (2021) Introducing split orders and optimizing operational policies in robotic mobile fulfillment systems. Eur J Oper Res 288(1):80\u201397. https:\/\/doi.org\/10.1016\/j.ejor.2020.05.032","journal-title":"Eur J Oper Res"},{"key":"5532_CR40","doi-asserted-by":"publisher","first-page":"105467","DOI":"10.1016\/j.cor.2021.105467","volume":"135","author":"X Yang","year":"2021","unstructured":"Yang X, Hua G, Hu L et al (2021) Joint optimization of order sequencing and rack scheduling in the robotic mobile fulfilment system. Comp Oper Res 135:105467. https:\/\/doi.org\/10.1016\/j.cor.2021.105467","journal-title":"Comp Oper Res"},{"issue":"14","key":"5532_CR41","doi-asserted-by":"publisher","first-page":"4434","DOI":"10.1080\/00207543.2020.1766712","volume":"59","author":"M Yousefi Nejad Attari","year":"2021","unstructured":"Yousefi Nejad Attari M, Ebadi Torkayesh A, Malmir B et al (2021) Robust possibilistic programming for joint order batching and picker routing problem in warehouse management. Int J Prod Res 59(14):4434\u20134452. https:\/\/doi.org\/10.1080\/00207543.2020.1766712","journal-title":"Int J Prod Res"},{"key":"5532_CR42","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.jmsy.2021.07.015","volume":"60","author":"T Yu","year":"2021","unstructured":"Yu T, Huang J, Chang Q (2021) Optimizing task scheduling in human-robot collaboration with deep multi-agent reinforcement learning. J Manuf Syst 60:487\u2013499. https:\/\/doi.org\/10.1016\/j.jmsy.2021.07.015","journal-title":"J Manuf Syst"},{"key":"5532_CR43","doi-asserted-by":"publisher","unstructured":"Zhang S, Zhuge D, Tan Z et al (2022) Order picking optimization in a robotic mobile fulfillment system. Expert Syst Appl 209:118338. https:\/\/doi.org\/10.1016\/j.eswa.2022.118338","DOI":"10.1016\/j.eswa.2022.118338"},{"key":"5532_CR44","doi-asserted-by":"publisher","unstructured":"Zhang Y, Bai R, Qu R et al (2022) A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties. Eur J Oper Res 300(2):418\u2013427. https:\/\/doi.org\/10.1016\/j.ejor.2021.10.032","DOI":"10.1016\/j.ejor.2021.10.032"},{"key":"5532_CR45","doi-asserted-by":"publisher","unstructured":"Zhen L, Tan Z, De\u00a0Koster R, et\u00a0al (2023) How to deploy robotic mobile fulfillment systems. Transportation Science p trsc.2022.0265. https:\/\/doi.org\/10.1287\/trsc.2022.0265","DOI":"10.1287\/trsc.2022.0265"},{"issue":"1","key":"5532_CR46","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ejor.2021.05.033","volume":"298","author":"I Zulj","year":"2022","unstructured":"Zulj I, Salewski H, Goeke D et al (2022) Order batching and batch sequencing in an AMR-assisted picker-to-parts system. Eur J Oper Res 298(1):182\u2013201. https:\/\/doi.org\/10.1016\/j.ejor.2021.05.033","journal-title":"Eur J Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05532-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05532-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05532-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T13:10:51Z","timestamp":1719234651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05532-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":46,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["5532"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05532-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"17 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Ethical approval was not required for this study as it involved no human or animal subjects. However, informed consent was obtained for all data used in the research.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and Informed Consent"}}]}}