{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:33:49Z","timestamp":1772120029837,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T00:00:00Z","timestamp":1724716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T00:00:00Z","timestamp":1724716800000},"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":["Memetic Comp."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s12293-024-00424-4","type":"journal-article","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T03:02:25Z","timestamp":1724727745000},"page":"467-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming"],"prefix":"10.1007","volume":"16","author":[{"given":"Chenwei","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruibin","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuyang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leshan","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,27]]},"reference":[{"key":"424_CR1","unstructured":"UNCTAD: Container Port Annual Throughput, 2010-2022. https:\/\/unctadstat.unctad.org\/datacentre\/dataviewer\/US.ContPortThroughput"},{"key":"424_CR2","doi-asserted-by":"publisher","unstructured":"Chen X, Bai R, Qu R, Dong H, Chen J (2020) A data-driven genetic programming heuristic for real-world dynamic seaport container terminal truck dispatching. In: 2020 IEEE congress on evolutionary computation (CEC), pp 1\u20138. https:\/\/doi.org\/10.1109\/CEC48606.2020.9185659","DOI":"10.1109\/CEC48606.2020.9185659"},{"issue":"7","key":"424_CR3","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1061\/(ASCE)TE.1943-5436.0000233","volume":"137","author":"H-C Chu","year":"2011","unstructured":"Chu H-C (2011) Empirical method for predicting internal\u2013external truck trips at a major port. J Transp Eng 137(7):496\u2013508","journal-title":"J Transp Eng"},{"issue":"1","key":"424_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1080\/00207543.2021.2013566","volume":"61","author":"R Bai","year":"2023","unstructured":"Bai R, Chen X, Chen Z-L, Cui T, Gong S, He W, Jiang X, Jin H, Jin J, Kendall G, Li J, Lu Z, Ren J, Weng P, Xue N, Zhang H (2023) Analytics and machine learning in vehicle routing research. Int J Prod Res 61(1):4\u201330","journal-title":"Int J Prod Res"},{"issue":"3","key":"424_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.apm.2004.09.009","volume":"29","author":"WC Ng","year":"2005","unstructured":"Ng WC, Mak KL (2005) Yard crane scheduling in port container terminals. Appl Math Model 29(3):263\u2013276. https:\/\/doi.org\/10.1016\/j.apm.2004.09.009","journal-title":"Appl Math Model"},{"issue":"8","key":"424_CR6","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1080\/03052150500323849","volume":"37","author":"WC Ng","year":"2005","unstructured":"Ng WC, Mak KL (2005) An effective heuristic for scheduling a yard crane to handle jobs with different ready times. Eng Optim 37(8):867\u2013877. https:\/\/doi.org\/10.1080\/03052150500323849","journal-title":"Eng Optim"},{"key":"424_CR7","unstructured":"Kumar M, S\u00a0N, O (2008) Optimization of yard crane scheduling using particle swarm optimization with genetic algorithm operators (psogao). J Sci Ind Res 67"},{"issue":"3","key":"424_CR8","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.aei.2011.02.002","volume":"25","author":"X Guo","year":"2011","unstructured":"Guo X, Huang SY, Hsu WJ, Low MYH (2011) Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information. Adv Eng Inf 25(3):472\u2013484. https:\/\/doi.org\/10.1016\/j.aei.2011.02.002","journal-title":"Adv Eng Inf"},{"key":"424_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.aei.2018.11.004","volume":"39","author":"J He","year":"2019","unstructured":"He J, Tan C, Zhang Y (2019) Yard crane scheduling problem in a container terminal considering risk caused by uncertainty. Adv Eng Inf 39:14\u201324. https:\/\/doi.org\/10.1016\/j.aei.2018.11.004","journal-title":"Adv Eng Inf"},{"issue":"13","key":"424_CR10","doi-asserted-by":"publisher","first-page":"4132","DOI":"10.1080\/00207543.2018.1516903","volume":"57","author":"F Zheng","year":"2019","unstructured":"Zheng F, Man X, Chu F, Liu M, Chu C (2019) A two-stage stochastic programming for single yard crane scheduling with uncertain release times of retrieval tasks. Int J Prod Res 57(13):4132\u20134147. https:\/\/doi.org\/10.1080\/00207543.2018.1516903","journal-title":"Int J Prod Res"},{"key":"424_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/5537114","volume":"2021","author":"W Liu","year":"2021","unstructured":"Liu W, Zhu X, Wang L, Yan B, Zhang X (2021) Optimization approach for yard crane scheduling problem with uncertain parameters in container terminals. J Adv Transp 2021:1\u201315. https:\/\/doi.org\/10.1155\/2021\/5537114","journal-title":"J Adv Transp"},{"issue":"9","key":"424_CR12","doi-asserted-by":"publisher","first-page":"2781","DOI":"10.1016\/j.asoc.2012.03.065","volume":"12","author":"D Jakobovi\u0107","year":"2012","unstructured":"Jakobovi\u0107 D, Marasovi\u0107 K (2012) Evolving priority scheduling heuristics with genetic programming. Appl Soft Comput 12(9):2781\u20132789. https:\/\/doi.org\/10.1016\/j.asoc.2012.03.065","journal-title":"Appl Soft Comput"},{"key":"424_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105782","volume":"85","author":"FJ Gil-Gala","year":"2019","unstructured":"Gil-Gala FJ, Menc\u00eda C, Sierra MR, Varela R (2019) Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time. Appl Soft Comput 85:105782. https:\/\/doi.org\/10.1016\/j.asoc.2019.105782","journal-title":"Appl Soft Comput"},{"issue":"5","key":"424_CR14","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1109\/TEVC.2022.3209985","volume":"27","author":"X Chen","year":"2023","unstructured":"Chen X, Bai R, Qu R, Dong H (2023) Cooperative double-layer genetic programming hyper-heuristic for online container terminal truck dispatching. IEEE Trans Evol Comput 27(5):1220\u20131234. https:\/\/doi.org\/10.1109\/TEVC.2022.3209985","journal-title":"IEEE Trans Evol Comput"},{"key":"424_CR15","doi-asserted-by":"publisher","unstructured":"Chen X, Bao F, Qu R, Dong J, Bai R (2023) Neural network assisted genetic programming in dynamic container port truck dispatching. In: 2023 IEEE 26th international conference on intelligent transportation systems (ITSC), pp 2246\u20132251. https:\/\/doi.org\/10.1109\/ITSC57777.2023.10422513","DOI":"10.1109\/ITSC57777.2023.10422513"},{"key":"424_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2024.3381042","author":"X Chen","year":"2024","unstructured":"Chen X, Bai R, Qu R, Dong J, Jin Y (2024) Deep reinforcement learning assisted genetic programming ensemble hyper-heuristics for dynamic scheduling of container port trucks. IEEE Trans Evolut Comput. https:\/\/doi.org\/10.1109\/TEVC.2024.3381042","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"424_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ejor.2023.11.038","volume":"315","author":"J Jin","year":"2023","unstructured":"Jin J, Cui T, Bai R, Qu R (2023) Container port truck dispatching optimization using Real2Sim based deep reinforcement learning. Eur J Oper Res 315(1):161\u2013175","journal-title":"Eur J Oper Res"},{"key":"424_CR18","doi-asserted-by":"publisher","unstructured":"Jin C, Bai R, Zhang H (2024) Evolving priority rules for online yard crane scheduling with incomplete tasks data. In: 2024 IEEE congress on evolutionary computation (CEC), pp 1\u201310. https:\/\/doi.org\/10.1109\/CEC60901.2024.10611875","DOI":"10.1109\/CEC60901.2024.10611875"},{"key":"424_CR19","doi-asserted-by":"publisher","unstructured":"\u0110urasevi\u0107 M, Planini\u0107 L, Gala FJG, Jakobovi\u0107 D (2022) Novel ensemble collaboration method for dynamic scheduling problems. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO \u201922, pp 893\u2013901. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3512290.3528807","DOI":"10.1145\/3512290.3528807"},{"key":"424_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106096","volume":"122","author":"M \u0110urasevi\u0107","year":"2023","unstructured":"\u0110urasevi\u0107 M, Gil-Gala FJ, Planini\u0107 L, Jakobovi\u0107 D (2023) Collaboration methods for ensembles of dispatching rules for the dynamic unrelated machines environment. Eng Appl Artif Intell 122:106096. https:\/\/doi.org\/10.1016\/j.engappai.2023.106096","journal-title":"Eng Appl Artif Intell"},{"key":"424_CR21","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.ins.2023.03.114","volume":"634","author":"FJ Gil-Gala","year":"2023","unstructured":"Gil-Gala FJ, \u0110urasevi\u0107 M, Varela R, Jakobovi\u0107 D (2023) Ensembles of priority rules to solve one machine scheduling problem in real-time. Inf Sci 634:340\u2013358. https:\/\/doi.org\/10.1016\/j.ins.2023.03.114","journal-title":"Inf Sci"},{"key":"424_CR22","doi-asserted-by":"publisher","unstructured":"Huang SY, Li Y, Guo X (2014) Yard crane dispatching to minimize vessel turnaround times in container terminals. In: Proceedings of the winter simulation conference 2014, pp 1747\u20131758. https:\/\/doi.org\/10.1109\/WSC.2014.7020024","DOI":"10.1109\/WSC.2014.7020024"},{"issue":"3\u20134","key":"424_CR23","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10696-017-9299-1","volume":"29","author":"SY Huang","year":"2017","unstructured":"Huang SY, Li Y (2017) Yard crane scheduling to minimize total weighted vessel loading time in container terminals. Flex Serv Manuf J 29(3\u20134):689\u2013720. https:\/\/doi.org\/10.1007\/s10696-017-9299-1","journal-title":"Flex Serv Manuf J"},{"issue":"2","key":"424_CR24","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ejor.2021.10.032","volume":"300","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Bai R, Qu R, Tu C, Jin J (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","journal-title":"Eur J Oper Res"},{"key":"424_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120568","volume":"230","author":"C Tu","year":"2023","unstructured":"Tu C, Bai R, Aickelin U, Zhang Y, Du H (2023) A deep reinforcement learning hyper-heuristic with feature fusion for online packing problems. Expert Syst Appl 230:120568. https:\/\/doi.org\/10.1016\/j.eswa.2023.120568","journal-title":"Expert Syst Appl"},{"issue":"9","key":"424_CR26","doi-asserted-by":"publisher","first-page":"2781","DOI":"10.1016\/j.asoc.2012.03.065","volume":"12","author":"D Jakobovi\u0107","year":"2012","unstructured":"Jakobovi\u0107 D, Marasovi\u0107 K (2012) Evolving priority scheduling heuristics with genetic programming. Appl Soft Comput 12(9):2781\u20132789. https:\/\/doi.org\/10.1016\/j.asoc.2012.03.065","journal-title":"Appl Soft Comput"},{"key":"424_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114548","volume":"172","author":"K Jaklinovi\u0107","year":"2021","unstructured":"Jaklinovi\u0107 K, \u0110urasevi\u0107 M, Jakobovi\u0107 D (2021) Designing dispatching rules with genetic programming for the unrelated machines environment with constraints. Expert Syst Appl 172:114548. https:\/\/doi.org\/10.1016\/j.eswa.2020.114548","journal-title":"Expert Syst Appl"},{"key":"424_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1_8","author":"D Bertsekas","year":"2013","unstructured":"Bertsekas D (2013) Rollout algorithms for discrete optimization: a survey. Handb Combin Optim. https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_8","journal-title":"Handb Combin Optim"},{"issue":"10","key":"424_CR29","doi-asserted-by":"publisher","first-page":"5043","DOI":"10.1007\/s00521-020-05292-w","volume":"33","author":"M \u0110urasevi\u0107","year":"2020","unstructured":"\u0110urasevi\u0107 M, Jakobovi\u0107 D (2020) Automatic design of dispatching rules for static scheduling conditions. Neural Comput Appl 33(10):5043\u20135068. https:\/\/doi.org\/10.1007\/s00521-020-05292-w","journal-title":"Neural Comput Appl"},{"issue":"12","key":"424_CR30","doi-asserted-by":"publisher","first-page":"3775","DOI":"10.1109\/TITS.2017.2780256","volume":"19","author":"F Zheng","year":"2018","unstructured":"Zheng F, Man X, Chu F, Liu M, Chu C (2018) Two yard crane scheduling with dynamic processing time and interference. IEEE Trans Intell Transp Syst 19(12):3775\u20133784. https:\/\/doi.org\/10.1109\/TITS.2017.2780256","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"4","key":"424_CR31","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1057\/palgrave.jors.2601322","volume":"53","author":"J-G Kang","year":"2002","unstructured":"Kang J-G, Kim Y-D (2002) Stowage planning in maritime container transportation. J Oper Res Soc 53(4):415\u2013426. https:\/\/doi.org\/10.1057\/palgrave.jors.2601322","journal-title":"J Oper Res Soc"},{"key":"424_CR32","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. https:\/\/doi.org\/10.1016\/j.tre.2018.06.003","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"424_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108787","volume":"174","author":"S Sun","year":"2022","unstructured":"Sun S, Zheng Y, Dong Y, Li N, Jin Z, Yu Q (2022) Reducing external container trucks\u2019 turnaround time in ports: a data-driven approach under truck appointment systems. Comput Ind Eng 174:108787. https:\/\/doi.org\/10.1016\/j.cie.2022.108787","journal-title":"Comput Ind Eng"},{"issue":"1\u20134","key":"424_CR34","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00170-013-4774-7","volume":"67","author":"Y Xi","year":"2013","unstructured":"Xi Y, Jang J (2013) Minimizing total weighted tardiness on a single machine with sequence-dependent setup and future ready time. Int J Adv Manuf Technol 67(1\u20134):281\u2013294. https:\/\/doi.org\/10.1007\/s00170-013-4774-7","journal-title":"Int J Adv Manuf Technol"},{"key":"424_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100869","volume":"63","author":"V Fernandez-Viagas","year":"2021","unstructured":"Fernandez-Viagas V, Costa A (2021) Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times. Swarm Evol Comput 63:100869. https:\/\/doi.org\/10.1016\/j.swevo.2021.100869","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"424_CR36","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du J, Leung JY-T (1990) Minimizing total tardiness on one machine is np-hard. Math Oper Res 15(3):483\u2013495. https:\/\/doi.org\/10.1287\/moor.15.3.483","journal-title":"Math Oper Res"},{"key":"424_CR37","doi-asserted-by":"publisher","unstructured":"Gil-Gala FJ, Sierra MR, Menc\u00eda C, Varela R (2021) Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity. Swarm Evol Comput 66:100944. https:\/\/doi.org\/10.1016\/j.swevo.2021.100944","DOI":"10.1016\/j.swevo.2021.100944"},{"issue":"4","key":"424_CR38","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler B, Thompson GL (1960) Algorithms for solving production-scheduling problems. Oper Res 8(4):487\u2013503","journal-title":"Oper Res"},{"key":"424_CR39","doi-asserted-by":"publisher","unstructured":"Zhang F, Mei Y, Nguyen S, Zhang M (2022) Learning strategies on scheduling heuristics of genetic programming in dynamic flexible job shop scheduling. In: 2022 IEEE congress on evolutionary computation (CEC), pp 1\u20138. https:\/\/doi.org\/10.1109\/CEC55065.2022.9870243","DOI":"10.1109\/CEC55065.2022.9870243"},{"key":"424_CR40","doi-asserted-by":"publisher","unstructured":"Langdon WB, Poli R, McPhee NF, Koza JR (2008) In: Fulcher, J., Jain, L.C. (eds.) Genetic programming: an introduction and tutorial, with a survey of techniques and applications, pp 927\u20131028. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-78293-3_22","DOI":"10.1007\/978-3-540-78293-3_22"},{"issue":"1","key":"424_CR41","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TEVC.2015.2429314","volume":"20","author":"J Branke","year":"2016","unstructured":"Branke J, Nguyen S, Pickardt CW, Zhang M (2016) Automated design of production scheduling heuristics: a review. IEEE Trans Evol Comput 20(1):110\u2013124. https:\/\/doi.org\/10.1109\/TEVC.2015.2429314","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"424_CR42","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1016\/j.cie.2007.08.011","volume":"54","author":"M Pfund","year":"2008","unstructured":"Pfund M, Fowler JW, Gadkari A, Chen Y (2008) Scheduling jobs on parallel machines with setup times and ready times. Comput Ind Eng 54(4):764\u2013782. https:\/\/doi.org\/10.1016\/j.cie.2007.08.011","journal-title":"Comput Ind Eng"},{"issue":"2","key":"424_CR43","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ejor.2018.12.003","volume":"275","author":"D Yu","year":"2019","unstructured":"Yu D, Li D, Sha M, Zhang D (2019) Carbon-efficient deployment of electric Rubber\u2013Tyred gantry cranes in container terminals with workload uncertainty. Eur J Oper Res 275(2):552\u2013569. https:\/\/doi.org\/10.1016\/j.ejor.2018.12.003","journal-title":"Eur J Oper Res"},{"issue":"2","key":"424_CR44","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.ijpe.2011.12.020","volume":"136","author":"W Li","year":"2012","unstructured":"Li W, Goh M, Wu Y, Petering MEH, de Souza R, Wu YC (2012) A continuous time model for multiple yard crane scheduling with last minute job arrivals. Int J Prod Econ 136(2):332\u2013343. https:\/\/doi.org\/10.1016\/j.ijpe.2011.12.020","journal-title":"Int J Prod Econ"},{"issue":"3","key":"424_CR45","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0925-5273(02)00466-8","volume":"84","author":"KH Kim","year":"2003","unstructured":"Kim KH, Lee KM, Hwang H (2003) Sequencing delivery and receiving operations for yard cranes in port container terminals. Int J Prod Econ 84(3):283\u2013292. https:\/\/doi.org\/10.1016\/S0925-5273(02)00466-8","journal-title":"Int J Prod Econ"},{"issue":"7\u20138","key":"424_CR46","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1007\/s00170-008-1762-4","volume":"43","author":"F-D Chou","year":"2008","unstructured":"Chou F-D, Wang H-M, Chang T-Y (2008) Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups. Int J Adv Manuf Technol 43(7\u20138):810\u2013821. https:\/\/doi.org\/10.1007\/s00170-008-1762-4","journal-title":"Int J Adv Manuf Technol"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00424-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-024-00424-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00424-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T03:23:25Z","timestamp":1726197805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-024-00424-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,27]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["424"],"URL":"https:\/\/doi.org\/10.1007\/s12293-024-00424-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4449908\/v1","asserted-by":"object"}]},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,27]]},"assertion":[{"value":"20 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 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 declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}