{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T17:07:24Z","timestamp":1758906444088,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2024,3,9]],"date-time":"2024-03-09T00:00:00Z","timestamp":1709942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,9]],"date-time":"2024-03-09T00:00:00Z","timestamp":1709942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100015498","name":"Innov\u00e1ci\u00f3s \u00e9s Technol\u00f3giai Miniszt\u00e9rium","doi-asserted-by":"publisher","award":["TKP2021-NVA-10"],"award-info":[{"award-number":["TKP2021-NVA-10"]}],"id":[{"id":"10.13039\/501100015498","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020998","name":"University of Pannonia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100020998","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As the environmental aspects become increasingly important, the disassembly problems have become the researcher\u2019s focus. Multiple criteria do not enable finding a general optimization method for the topic, but some heuristics and classical formulations provide effective solutions. By highlighting that disassembly problems are not the straight inverses of assembly problems and the conditions are not standard, disassembly optimization solutions require human control and supervision. Considering that Reinforcement learning (RL) methods can successfully solve complex optimization problems, we developed an RL-based solution for a fully formalized disassembly problem. There were known successful implementations of RL-based optimizers. But we integrated a novel heuristic to target a dynamically pre-filtered action space for the RL agent (<jats:sc>dl<\/jats:sc>O<jats:sc>pt<\/jats:sc>RL algorithm) and hence significantly raise the efficiency of the learning path. Our algorithm belongs to the Heuristically Accelerated Reinforcement Learning (HARL) method class. We demonstrated its applicability in two use cases, but our approach can also be easily adapted for other problem types. Our article gives a detailed overview of disassembly problems and their formulation, the general RL framework and especially Q-learning techniques, and a perfect example of extending RL learning with a built-in heuristic.<\/jats:p>","DOI":"10.1007\/s10100-024-00906-3","type":"journal-article","created":{"date-parts":[[2024,3,9]],"date-time":"2024-03-09T04:32:12Z","timestamp":1709958732000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Disassembly line optimization with reinforcement learning"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Kegyes","sequence":"first","affiliation":[]},{"given":"Zolt\u00e1n","family":"S\u00fcle","sequence":"additional","affiliation":[]},{"given":"J\u00e1nos","family":"Abonyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,9]]},"reference":[{"issue":"3","key":"906_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1108\/01443579910249714","volume":"19","author":"BM Beamon","year":"1999","unstructured":"Beamon BM (1999) Measuring supply chain performance. Int J Oper Prod Manag 19(3):275\u2013292","journal-title":"Int J Oper Prod Manag"},{"key":"906_CR2","unstructured":"Bianchi RA, Ribeiro CH, Costa AHR (2012) Heuristically accelerated reinforcement learning: theoretical and experimental results. In: ECAI, pp 169\u2013174"},{"key":"906_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.artint.2015.05.008","volume":"226","author":"RAC Bianchi","year":"2015","unstructured":"Bianchi RAC, Celiberto JLA, Santos PE, Matsuura JP, Lopez De Mantaras R (2015) Transferring knowledge as heuristics in reinforcement learning: a case-based approach. Artif Intell 226:102\u2013121","journal-title":"Artif Intell"},{"issue":"8","key":"906_CR4","doi-asserted-by":"publisher","first-page":"2758","DOI":"10.3390\/su10082758","volume":"10","author":"J Camacho-Otero","year":"2018","unstructured":"Camacho-Otero J, Boks C, Pettersen IN (2018) Consumption in the circular economy: a literature review. Sustainability (Switzerland) 10(8):2758","journal-title":"Sustainability (Switzerland)"},{"key":"906_CR5","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.cirpj.2022.11.017","volume":"41","author":"M Chand","year":"2023","unstructured":"Chand M, Ravi C (2023) A state-of-the-art literature survey on artificial intelligence techniques for disassembly sequence planning. CIRP J Manuf Sci Technol 41:292\u2013310","journal-title":"CIRP J Manuf Sci Technol"},{"issue":"9","key":"906_CR6","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1080\/0305215X.2021.1957468","volume":"54","author":"JC Chen","year":"2022","unstructured":"Chen JC, Chen Y-Y, Chen T-L, Yang Y-C (2022) An adaptive genetic algorithm-based and and\/or graph approach for the disassembly line balancing problem. Eng Optim 54(9):1583\u20131599","journal-title":"Eng Optim"},{"key":"906_CR7","first-page":"13550","volume":"34","author":"C-A Cheng","year":"2021","unstructured":"Cheng C-A, Kolobov A, Swaminathan A (2021) Heuristic-guided reinforcement learning. Adv Neural Inf Process Syst 34:13550\u201313563","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"906_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"R de Koster","year":"2007","unstructured":"de Koster R, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: a literature review. Eur J Oper Res 182(2):481\u2013501","journal-title":"Eur J Oper Res"},{"issue":"2","key":"906_CR9","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.cirp.2008.09.009","volume":"57","author":"JR Duflou","year":"2008","unstructured":"Duflou JR, Seliger G, Kara S, Umeda Y, Ometto A, Willems B (2008) Efficiency and feasibility of product disassembly: a case-based study. CIRP Ann Manuf Technol 57(2):583\u2013600","journal-title":"CIRP Ann Manuf Technol"},{"issue":"4","key":"906_CR10","doi-asserted-by":"publisher","first-page":"350","DOI":"10.3844\/ajessp.2010.350.356","volume":"6","author":"T Go","year":"2010","unstructured":"Go T, Wahab D, Rahman MA, Ramli R et al (2010) A design framework for end-of-life vehicles recovery: optimization of disassembly sequence using genetic algorithms. Am J Environ Sci 6(4):350","journal-title":"Am J Environ Sci"},{"issue":"1","key":"906_CR11","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1108\/AA-12-2017-180","volume":"39","author":"J Guo","year":"2018","unstructured":"Guo J, Zhong J, Li Y, Du B, Guo S (2018) A hybrid artificial fish swam algorithm for disassembly sequence planning considering setup time. Assem Autom 39(1):140\u2013153","journal-title":"Assem Autom"},{"issue":"1\u20132","key":"906_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0360-8352(96)00146-5","volume":"31","author":"SM Gupta","year":"1996","unstructured":"Gupta SM, McLean CR (1996) Disassembly of products. Comput Ind Eng 31(1\u20132):225\u2013228","journal-title":"Comput Ind Eng"},{"issue":"8","key":"906_CR13","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1080\/00207549408957046","volume":"32","author":"S Gupta","year":"1994","unstructured":"Gupta S, Taleb K (1994) Scheduling disassembly. Int J Prod Res 32(8):1857\u20131866","journal-title":"Int J Prod Res"},{"issue":"4","key":"906_CR14","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1108\/14635770510609015","volume":"12","author":"AA Hervani","year":"2005","unstructured":"Hervani AA, Helms MM, Sarkis J (2005) Performance measurement for green supply chain management. Benchmarking 12(4):330\u2013353","journal-title":"Benchmarking"},{"issue":"8","key":"906_CR15","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1109\/TSMC.2016.2531659","volume":"47","author":"H-P Hsu","year":"2016","unstructured":"Hsu H-P (2016) A fuzzy knowledge-based disassembly process planning system based on fuzzy attributed and timed predicate\/transition net. IEEE Trans Syst Man Cybern Syst 47(8):1800\u20131813","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"2","key":"906_CR16","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0007-8506(07)62530-X","volume":"42","author":"F Jovane","year":"1993","unstructured":"Jovane F, Alting L, Armillotta A, Eversheim W, Feldmann K, Seliger G, Roth N (1993) A key issue in product life cycle: disassembly. CIRP Ann Manuf Technol 42(2):651\u2013658","journal-title":"CIRP Ann Manuf Technol"},{"issue":"2","key":"906_CR17","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2015.09.004","volume":"249","author":"EG Kalaycilar","year":"2016","unstructured":"Kalaycilar EG, Azizoglu M, Yeralan S (2016) A disassembly line balancing problem with fixed number of workstations. Eur J Oper Res 249(2):592\u2013604","journal-title":"Eur J Oper Res"},{"key":"906_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.resconrec.2017.10.034","volume":"135","author":"Y Kalmykova","year":"2018","unstructured":"Kalmykova Y, Sadagopan M, Rosado L (2018) Circular economy\u2013from review of theories and practices to development of implementation tools. Resour Conserv Recycl 135:190\u2013201","journal-title":"Resour Conserv Recycl"},{"issue":"18\u201319","key":"906_CR19","doi-asserted-by":"publisher","first-page":"4465","DOI":"10.1080\/00207540701440097","volume":"45","author":"H-J Kim","year":"2007","unstructured":"Kim H-J, Lee D-H, Xirouchakis P (2007) Disassembly scheduling: literature review and future research directions. Int J Prod Res 45(18\u201319):4465\u20134484","journal-title":"Int J Prod Res"},{"issue":"3","key":"906_CR20","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1057\/palgrave.jors.2602568","volume":"60","author":"H-J Kim","year":"2009","unstructured":"Kim H-J, Lee D-H, Xirouchakis P, Kwon O (2009) A branch and bound algorithm for disassembly scheduling with assembly product structure. J Oper Res Soc 60(3):419\u2013430","journal-title":"J Oper Res Soc"},{"key":"906_CR21","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.jmsy.2020.07.015","volume":"56","author":"Y Laili","year":"2020","unstructured":"Laili Y, Li Y, Fang Y, Pham DT, Zhang L (2020) Model review and algorithm comparison on multi-objective disassembly line balancing. J Manuf Syst 56:484\u2013500","journal-title":"J Manuf Syst"},{"key":"906_CR22","doi-asserted-by":"publisher","DOI":"10.1201\/9780203487174","volume-title":"Disassembly modeling for assembly, maintenance reuse and recycling","author":"AJD Lambert","year":"2004","unstructured":"Lambert AJD, Gupta SM (2004) Disassembly modeling for assembly, maintenance reuse and recycling. CRC Press, Boca Raton, FL, USA"},{"issue":"10","key":"906_CR23","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1243\/0954405042323586","volume":"218","author":"D Lee","year":"2004","unstructured":"Lee D, Kim H, Choi G, Xirouchakis P (2004) Disassembly scheduling: integer programming models. Proc Inst Mech Eng Part B J Eng Manuf 218(10):1357\u20131372","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"issue":"4","key":"906_CR24","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.rcim.2013.01.006","volume":"29","author":"W Li","year":"2013","unstructured":"Li W, Xia K, Gao L, Chao K-M (2013) Selective disassembly planning for waste electrical and electronic equipment with case studies on liquid crystaldisplays. Robot Comput Integr Manuf 29(4):248\u2013260","journal-title":"Robot Comput Integr Manuf"},{"key":"906_CR25","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.jclepro.2016.08.024","volume":"139","author":"E Loiseau","year":"2016","unstructured":"Loiseau E, Saikku L, Antikainen R, Droste N, Hansj\u00fcrgens B, Pitk\u00e4nen K, Leskinen P, Kuikman P, Thomsen M (2016) Green economy and related concepts: an overview. J Clean Prod 139:361\u2013371","journal-title":"J Clean Prod"},{"key":"906_CR26","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.compind.2015.10.011","volume":"75","author":"Y Luo","year":"2016","unstructured":"Luo Y, Peng Q, Gu P (2016) Integrated multi-layer representation and ant colony search for product selective disassembly planning. Comput Ind 75:13\u201326","journal-title":"Comput Ind"},{"key":"906_CR27","doi-asserted-by":"crossref","unstructured":"Mete S, Serin F (2021) A reinforcement learning approach for disassembly line balancing problem. In: 2021 international conference on information technology (ICIT), IEEE, pp 424\u2013427","DOI":"10.1109\/ICIT52682.2021.9491689"},{"key":"906_CR28","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00170-015-6861-4","volume":"80","author":"P Mitrouchev","year":"2015","unstructured":"Mitrouchev P, Wang C, Lu L, Li G (2015) Selective disassembly sequence generation based on lowest level disassembly graph method. Int J Adv Manuf Technol 80:141\u2013159","journal-title":"Int J Adv Manuf Technol"},{"issue":"3\u20134","key":"906_CR29","first-page":"295","volume":"47","author":"K-P Neuendorf","year":"2001","unstructured":"Neuendorf K-P, Lee D-H, Kiritsis D, Xirouchakis P (2001) Disassembly scheduling with parts commonality using petri nets with timestamps. Fundam Inform 47(3\u20134):295\u2013306","journal-title":"Fundam Inform"},{"key":"906_CR30","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.engappai.2017.06.025","volume":"64","author":"Y Ren","year":"2017","unstructured":"Ren Y, Tian G, Zhao F, Yu D, Zhang C (2017) Selective cooperative disassembly planning based on multi-objective discrete artificial bee colony algorithm. Eng Appl Artif Intell 64:415\u2013431","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"906_CR31","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.ejor.2018.01.055","volume":"269","author":"Y Ren","year":"2018","unstructured":"Ren Y, Zhang C, Zhao F, Xiao H, Tian G (2018) An asynchronous parallel disassembly planning based on genetic algorithm. Eur J Oper Res 269(2):647\u2013660","journal-title":"Eur J Oper Res"},{"issue":"1","key":"906_CR32","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.jmsy.2012.11.005","volume":"32","author":"JL Rickli","year":"2013","unstructured":"Rickli JL, Camelio JA (2013) Multi-objective partial disassembly optimization based on sequence feasibility. J Manuf Syst 32(1):281\u2013293","journal-title":"J Manuf Syst"},{"issue":"3","key":"906_CR33","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1080\/19397030802433860","volume":"1","author":"P Sasikumar","year":"2008","unstructured":"Sasikumar P, Kannan G (2008) Issues in reverse supply chains, part I: end-of-life product recovery and inventory management\u2013an overview. Int J Sustain Eng 1(3):154\u2013172","journal-title":"Int J Sustain Eng"},{"issue":"2","key":"906_CR34","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.aei.2011.11.003","volume":"26","author":"S Smith","year":"2012","unstructured":"Smith S, Smith G, Chen W-H (2012) Disassembly sequence structure graphs: an optimal approach for multiple-target selective disassembly sequence planning. Adv Eng Inform 26(2):306\u2013316","journal-title":"Adv Eng Inform"},{"key":"906_CR35","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: an introduction, 2nd edn. The MIT Press, Cambridge, MA, USA","edition":"2"},{"issue":"4","key":"906_CR36","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/S0360-8352(97)00023-5","volume":"32","author":"KN Taleb","year":"1997","unstructured":"Taleb KN, Gupta SM (1997) Disassembly of multiple product structures. Comput Ind Eng 32(4):949\u2013961","journal-title":"Comput Ind Eng"},{"issue":"3","key":"906_CR37","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1080\/095372897235316","volume":"8","author":"KN Taleb","year":"1997","unstructured":"Taleb KN, Gupta SM, Brennan L (1997) Disassembly of complex product structures with parts and materials commonality. Prod Plan Control 8(3):255\u2013269","journal-title":"Prod Plan Control"},{"issue":"4","key":"906_CR38","doi-asserted-by":"publisher","first-page":"2456","DOI":"10.1109\/TII.2018.2884845","volume":"15","author":"G Tian","year":"2018","unstructured":"Tian G, Ren Y, Feng Y, Zhou M, Zhang H, Tan J (2018) Modeling and planning for dual-objective selective disassembly using and\/or graph and discrete artificial bee colony. IEEE Trans Ind Inform 15(4):2456\u20132468","journal-title":"IEEE Trans Ind Inform"},{"issue":"5","key":"906_CR39","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1007\/s00170-019-04241-9","volume":"105","author":"Y Tian","year":"2019","unstructured":"Tian Y, Zhang X, Liu Z, Jiang X, Xue J (2019) Product cooperative disassembly sequence and task planning based on genetic algorithm. Int J Adv Manuf Technol 105(5):2103\u20132120","journal-title":"Int J Adv Manuf Technol"},{"key":"906_CR40","doi-asserted-by":"crossref","unstructured":"Tseng H-E, Lee S-C (2018) Disassembly sequence planning using interactive genetic algorithms. In: 2018 14th international conference on natural computation, fuzzy systems and knowledge discovery (ICNC-FSKD), IEEE, pp 77\u201384","DOI":"10.1109\/FSKD.2018.8686887"},{"key":"906_CR41","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.engappai.2019.04.015","volume":"83","author":"H-E Tseng","year":"2019","unstructured":"Tseng H-E, Chang C-C, Lee S-C, Huang Y-M (2019) Hybrid bidirectional ant colony optimization (hybrid baco): an algorithm for disassembly sequence planning. Eng Appl Artif Intell 83:45\u201356","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"906_CR42","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10845-012-0711-0","volume":"25","author":"E Tuncel","year":"2014","unstructured":"Tuncel E, Zeid A, Kamarthi S (2014) Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning. J Intell Manuf 25(4):647\u2013659","journal-title":"J Intell Manuf"},{"key":"906_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2021.109616","volume":"182","author":"ZJ Viharos","year":"2021","unstructured":"Viharos ZJ, Jakab R (2021) Reinforcement learning for statistical process control in manufacturing. Measurement 182:109616","journal-title":"Measurement"},{"key":"906_CR44","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.cad.2013.09.001","volume":"47","author":"H Wang","year":"2014","unstructured":"Wang H, Rong Y, Xiang D (2014) Mechanical assembly planning using ant colony optimization. Comput Aided Des 47:59\u201371","journal-title":"Comput Aided Des"},{"issue":"5","key":"906_CR45","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s00170-015-7065-7","volume":"80","author":"J Wang","year":"2015","unstructured":"Wang J, Wu X, Fan X (2015) A two-stage ant colony optimization approach based on a directed graph for process planning. Int J Adv Manuf Technol 80(5):839\u2013850","journal-title":"Int J Adv Manuf Technol"},{"issue":"5","key":"906_CR46","first-page":"1223","volume":"16","author":"S Woo","year":"2020","unstructured":"Woo S, Sung Y (2020) Dynamic action space handling method for reinforcement learning models. J Inf Process Syst 16(5):1223\u20131230","journal-title":"J Inf Process Syst"},{"key":"906_CR47","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.elerap.2016.09.007","volume":"20","author":"K Xia","year":"2016","unstructured":"Xia K, Gao L, Wang L, Li W, Li X, Ijomah W (2016) Service-oriented disassembly sequence planning for electrical and electronic equipment waste. Electron Commer Res Appl 20:59\u201368","journal-title":"Electron Commer Res Appl"},{"key":"906_CR48","doi-asserted-by":"crossref","unstructured":"Xia K, Gao L, Wang L, Li W, Chao K-M (2013) A simplified teaching-learning-based optimization algorithm for disassembly sequence planning. In: 2013 IEEE 10th international conference on e-business engineering, IEEE, pp 393\u2013398","DOI":"10.1109\/ICEBE.2013.60"},{"key":"906_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2019.101860","volume":"62","author":"W Xu","year":"2020","unstructured":"Xu W, Tang Q, Liu J, Liu Z, Zhou Z, Pham DT (2020) Disassembly sequence planning using discrete bees algorithm for human-robot collaboration in remanufacturing. Robot Comput Integr Manuf 62:101860","journal-title":"Robot Comput Integr Manuf"},{"key":"906_CR50","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00170-014-5655-4","volume":"72","author":"XF Zhang","year":"2014","unstructured":"Zhang XF, Yu G, Hu ZY, Pei CH, Ma GQ (2014) Parallel disassembly sequence planning for complex products based on fuzzy-rough sets. Int J Adv Manuf Technol 72:231\u2013239","journal-title":"Int J Adv Manuf Technol"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00906-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-024-00906-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00906-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,9]],"date-time":"2024-03-09T05:08:16Z","timestamp":1709960896000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-024-00906-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,9]]},"references-count":50,"alternative-id":["906"],"URL":"https:\/\/doi.org\/10.1007\/s10100-024-00906-3","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2024,3,9]]},"assertion":[{"value":"12 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 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 the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}