{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:59:51Z","timestamp":1774540791523,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Hubei Key Laboratory of Hydroelectric Machinery Design & Maintenance (Three Gorges University) Open Fund Funded Project","award":["2021KJX12"],"award-info":[{"award-number":["2021KJX12"]}]},{"name":"Open Research Fund Program of State Key Laboratory of Eco-hydraulics in Northwest Arid Region, Xi\u2019an University of Technology","award":["2022KFKT-13"],"award-info":[{"award-number":["2022KFKT-13"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51741907"],"award-info":[{"award-number":["51741907"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11227-024-06540-9","type":"journal-article","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T14:52:20Z","timestamp":1729003940000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Application of discrete random forest algorithm in multi-person asynchronous parallel disassembly sequence planning for hydropower station equipment maintenance"],"prefix":"10.1007","volume":"81","author":[{"given":"Li","family":"Bailin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Ao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Panqi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fu","family":"Wenlong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,15]]},"reference":[{"issue":"11","key":"6540_CR1","doi-asserted-by":"publisher","first-page":"3493","DOI":"10.1080\/00207543.2020.1868598","volume":"59","author":"SK Ong","year":"2021","unstructured":"Ong SK, Chang MML, Nee AYC (2021) Product disassembly sequence planning: state-of-the-art, challenges, opportunities and future directions. Int J Prod Res 59(11):3493\u20133508. https:\/\/doi.org\/10.1080\/00207543.2020.1868598","journal-title":"Int J Prod Res"},{"key":"6540_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cad.2015.05.001","volume":"67\u201368","author":"S Ghandi","year":"2015","unstructured":"Ghandi S, Masehian E (2015) Review and taxonomies of assembly and disassembly path planning problems and approaches. Comput-Aided Des 67\u201368:58\u201386. https:\/\/doi.org\/10.1016\/j.cad.2015.05.001","journal-title":"Comput-Aided Des"},{"key":"6540_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.aei.2022.101821","volume":"55","author":"L Guo","year":"2023","unstructured":"Guo L, Zhang ZQ, Zhang XF (2023) Human-robot collaborative partial destruction disassembly sequence planning method for end-of-life product driven by multi-failures. Adv Eng Inform 55:13. https:\/\/doi.org\/10.1016\/j.aei.2022.101821","journal-title":"Adv Eng Inform"},{"key":"6540_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.eswa.2022.118046","volume":"208","author":"PQ Wu","year":"2022","unstructured":"Wu PQ, Wang HH, Li BL, Fu WL, Ren J, He Q (2022) Disassembly sequence planning and application using simplified discrete gravitational search algorithm for equipment maintenance in hydropower station. Expert Syst Appl 208:15. https:\/\/doi.org\/10.1016\/j.eswa.2022.118046","journal-title":"Expert Syst Appl"},{"key":"6540_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. https:\/\/doi.org\/10.1016\/j.cirpj.2022.11.017","journal-title":"CIRP J Manuf Sci Technol"},{"issue":"11","key":"6540_CR6","doi-asserted-by":"publisher","first-page":"3872","DOI":"10.1080\/00207543.2023.2251064","volume":"62","author":"YL Fang","year":"2023","unstructured":"Fang YL, Li ZY, Wang SW, Lu XW (2023) Multi-objective multi-fidelity optimisation for position-constrained human-robot collaborative disassembly planning. Int J Prod Res 62(11):3872\u20133889. https:\/\/doi.org\/10.1080\/00207543.2023.2251064","journal-title":"Int J Prod Res"},{"issue":"2","key":"6540_CR7","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TASE.2020.2992220","volume":"18","author":"X Guo","year":"2021","unstructured":"Guo X, Zhou M, Liu S, Qi L (2021) Multiresource-constrained selective disassembly with maximal profit and minimal energy consumption. IEEE Trans Autom Sci Eng 18(2):804\u2013816. https:\/\/doi.org\/10.1109\/TASE.2020.2992220","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"6540_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.neucom.2018.05.120","volume":"348","author":"YF Yang","year":"2019","unstructured":"Yang YF, Yang P, Li J, Zeng F, Yang M, Wang R et al (2019) Research on virtual haptic disassembly platform considering disassembly process. Neurocomputing 348:74\u201381. https:\/\/doi.org\/10.1016\/j.neucom.2018.05.120","journal-title":"Neurocomputing"},{"issue":"4","key":"6540_CR9","doi-asserted-by":"publisher","first-page":"2456","DOI":"10.1109\/TII.2018.2884845","volume":"15","author":"G Tian","year":"2019","unstructured":"Tian G, Ren Y, Feng Y, Zhou M, Zhang H, Tan J (2019) Modeling and planning for dual-objective selective disassembly using AND\/OR graph and discrete artificial bee colony. IEEE Trans Industr Info 15(4):2456\u20132468. https:\/\/doi.org\/10.1109\/TII.2018.2884845","journal-title":"IEEE Trans Industr Info"},{"issue":"15","key":"6540_CR10","doi-asserted-by":"publisher","first-page":"4105","DOI":"10.1080\/00207543.2011.591188","volume":"50","author":"R Edmunds","year":"2012","unstructured":"Edmunds R, Kobayashi M, Higashi M (2012) Using constraint-satisfaction to optimise disassembly sequences generated from AND\/OR information. Int J Prod Res 50(15):4105\u20134126. https:\/\/doi.org\/10.1080\/00207543.2011.591188","journal-title":"Int J Prod Res"},{"issue":"4","key":"6540_CR11","doi-asserted-by":"publisher","first-page":"4351","DOI":"10.1007\/s11227-022-04822-8","volume":"79","author":"WL Fu","year":"2023","unstructured":"Fu WL, Liu X, Chu FW, Li BL, Gu JH (2023) A disassembly sequence planning method with improved discrete grey wolf optimizer for equipment maintenance in hydropower station. J Supercomput 79(4):4351\u20134382. https:\/\/doi.org\/10.1007\/s11227-022-04822-8","journal-title":"J Supercomput"},{"issue":"3","key":"6540_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s40009-020-00994-0","volume":"44","author":"M Bahubalendruni","year":"2021","unstructured":"Bahubalendruni M, Varupala VP (2021) Disassembly sequence planning for safe disposal of end-of-life waste electric and electronic equipment. Natl Acad Sci Lett-India 44(3):243\u2013247. https:\/\/doi.org\/10.1007\/s40009-020-00994-0","journal-title":"Natl Acad Sci Lett-India"},{"key":"6540_CR13","doi-asserted-by":"publisher","first-page":"101860","DOI":"10.1016\/j.rcim.2019.101860","volume":"62","author":"WJ Xu","year":"2020","unstructured":"Xu WJ, 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. https:\/\/doi.org\/10.1016\/j.rcim.2019.101860","journal-title":"Robot Comput-Integr Manuf"},{"issue":"12","key":"6540_CR14","doi-asserted-by":"publisher","first-page":"2281","DOI":"10.1177\/0954406214557340","volume":"229","author":"M Kheder","year":"2015","unstructured":"Kheder M, Trigui M, Aifaoui N (2015) Disassembly sequence planning based on a genetic algorithm. Proc Inst Mech Eng Part C-J Eng Mech Eng Sci 229(12):2281\u20132290. https:\/\/doi.org\/10.1177\/0954406214557340","journal-title":"Proc Inst Mech Eng Part C-J Eng Mech Eng Sci"},{"issue":"5\u20136","key":"6540_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00170-005-0041-x","volume":"30","author":"E Kongar","year":"2006","unstructured":"Kongar E, Gupta SM (2006) Disassembly sequencing using genetic algorithm. Int J Adv Manuf Technol 30(5\u20136):497\u2013506. https:\/\/doi.org\/10.1007\/s00170-005-0041-x","journal-title":"Int J Adv Manuf Technol"},{"key":"6540_CR16","doi-asserted-by":"publisher","first-page":"47538","DOI":"10.1109\/access.2020.2979247","volume":"8","author":"B Li","year":"2020","unstructured":"Li B, Li C, Ciu X, Lai X, Ren J, He Q (2020) A disassembly sequence planning method with team-based genetic algorithm for equipment maintenance in hydropower station. IEEE Access 8:47538\u201347555. https:\/\/doi.org\/10.1109\/access.2020.2979247","journal-title":"IEEE Access"},{"issue":"12","key":"6540_CR17","doi-asserted-by":"publisher","first-page":"2438","DOI":"10.1109\/tsmc.2018.2847448","volume":"49","author":"YX Feng","year":"2019","unstructured":"Feng YX, Zhou MC, Tian GD, Li ZW, Zhang ZF, Zhang Q et al (2019) Target disassembly sequencing and scheme evaluation for CNC machine tools using improved multiobjective ant colony algorithm and fuzzy integral. IEEE Trans Syst Man Cybern -Syst 49(12):2438\u20132451. https:\/\/doi.org\/10.1109\/tsmc.2018.2847448","journal-title":"IEEE Trans Syst Man Cybern -Syst"},{"key":"6540_CR18","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 YM, Xiang D (2014) Mechanical assembly planning using ant colony optimization. Comput-Aided Des 47:59\u201371. https:\/\/doi.org\/10.1016\/j.cad.2013.09.001","journal-title":"Comput-Aided Des"},{"issue":"1\u20134","key":"6540_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00170-013-4990-1","volume":"69","author":"CB Kalayci","year":"2013","unstructured":"Kalayci CB, Gupta SM (2013) A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem. Int J Adv Manuf Technol 69(1\u20134):197\u2013209. https:\/\/doi.org\/10.1007\/s00170-013-4990-1","journal-title":"Int J Adv Manuf Technol"},{"key":"6540_CR20","doi-asserted-by":"publisher","first-page":"80555","DOI":"10.1109\/access.2022.3195863","volume":"10","author":"HE Tseng","year":"2022","unstructured":"Tseng HE, Chang CC, Chung TW (2022) Applying improved particle swarm optimization to asynchronous parallel disassembly planning. IEEE Access 10:80555\u201380564. https:\/\/doi.org\/10.1109\/access.2022.3195863","journal-title":"IEEE Access"},{"issue":"9\u201312","key":"6540_CR21","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1007\/s00170-011-3339-x","volume":"57","author":"YJ Tseng","year":"2011","unstructured":"Tseng YJ, Yu FY, Huang FY (2011) A green assembly sequence planning model with a closed-loop assembly and disassembly sequence planning using a particle swarm optimization method. Int J Adv Manuf Technol 57(9\u201312):1183\u20131197. https:\/\/doi.org\/10.1007\/s00170-011-3339-x","journal-title":"Int J Adv Manuf Technol"},{"issue":"10\u201312","key":"6540_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1080\/09544828.2015.1045841","volume":"26","author":"S Smith","year":"2015","unstructured":"Smith S, Hung PY (2015) A novel selective parallel disassembly planning method for green design. J Eng Des 26(10\u201312):283\u2013301. https:\/\/doi.org\/10.1080\/09544828.2015.1045841","journal-title":"J Eng Des"},{"key":"6540_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2023.3296733","author":"XW Guo","year":"2023","unstructured":"Guo XW, Fan CY, Zhou MC, Liu SX, Wang JC, Qin SJ et al (2023) Human-robot collaborative disassembly line balancing problem with stochastic operation time and a solution via multi-objective shuffled frog leaping algorithm. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/tase.2023.3296733","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"6540_CR24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.compind.2023.103992","volume":"151","author":"A Allagui","year":"2023","unstructured":"Allagui A, Belhadj I, Plateaux R, Hammadi M, Penas O, Aifaoui N (2023) Reinforcement learning for disassembly sequence planning optimization. Comput Ind 151:17. https:\/\/doi.org\/10.1016\/j.compind.2023.103992","journal-title":"Comput Ind"},{"issue":"2","key":"6540_CR25","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1108\/ria-06-2022-0156","volume":"43","author":"JQ Ji","year":"2023","unstructured":"Ji JQ, Wang Y (2023) Selective disassembly sequence optimization based on the improved immune algorithm. Robot Intell Autom 43(2):96\u2013108. https:\/\/doi.org\/10.1108\/ria-06-2022-0156","journal-title":"Robot Intell Autom"},{"issue":"2","key":"6540_CR26","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11749-016-0481-7","volume":"25","author":"G Biau","year":"2016","unstructured":"Biau G, Scornet E (2016) A random forest guided tour. Test 25(2):197\u2013227. https:\/\/doi.org\/10.1007\/s11749-016-0481-7","journal-title":"Test"},{"issue":"3","key":"6540_CR27","doi-asserted-by":"publisher","first-page":"381","DOI":"10.4310\/SII.2009.v2.n3.a11","volume":"2","author":"HP Zhang","year":"2009","unstructured":"Zhang HP, Wang MH (2009) Search for the smallest random forest. Stat Interface 2(3):381\u2013388","journal-title":"Stat Interface"},{"issue":"5\u20138","key":"6540_CR28","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s00170-013-5089-4","volume":"69","author":"XH Liu","year":"2013","unstructured":"Liu XH, Liu YH, Xu BH (2013) A converse method-based approach for assembly sequence planning with assembly tool. Int J Adv Manuf Technol 69(5\u20138):1359\u20131371. https:\/\/doi.org\/10.1007\/s00170-013-5089-4","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"6540_CR29","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1108\/00022661111131221","volume":"83","author":"Z Lu","year":"2011","unstructured":"Lu Z, Sun YC, Gabriel OE, Wu HQ (2011) Disassembly sequence planning for maintenance based on metaheuristic method. Aircr Eng Aerosp Technol 83(3):138\u2013145. https:\/\/doi.org\/10.1108\/00022661111131221","journal-title":"Aircr Eng Aerosp Technol"},{"key":"6540_CR30","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jestch.2021.04.013","volume":"26","author":"GA Kumar","year":"2022","unstructured":"Kumar GA, Bahubalendruni M, Prasad V, Ashok D, Sankaranarayanasamy K (2022) A novel geometric feasibility method to perform assembly sequence planning through oblique orientations. Eng Sci Technol 26:16. https:\/\/doi.org\/10.1016\/j.jestch.2021.04.013","journal-title":"Eng Sci Technol"},{"issue":"1","key":"6540_CR31","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332. https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach Learn"},{"issue":"1","key":"6540_CR32","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/tsmca.2011.2157135","volume":"42","author":"WC Yeh","year":"2012","unstructured":"Yeh WC (2012) Optimization of the disassembly sequencing problem on the basis of self-adaptive simplified swarm optimization. IEEE Trans Syst Man Cybern Paart A-Syst Hum 42(1):250\u2013261. https:\/\/doi.org\/10.1109\/tsmca.2011.2157135","journal-title":"IEEE Trans Syst Man Cybern Paart A-Syst Hum"},{"key":"6540_CR33","doi-asserted-by":"publisher","DOI":"10.3390\/pr12071412","author":"ZW Zhong","year":"2024","unstructured":"Zhong ZW, Zhu LK, Fu WL, Qin JF, Zhao MZ, Rixi A (2024) Parallel disassembly sequence planning using a discrete whale optimization algorithm for equipment maintenance in hydropower station. Processes. https:\/\/doi.org\/10.3390\/pr12071412","journal-title":"Processes"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06540-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06540-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06540-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:06:43Z","timestamp":1729004803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06540-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,15]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6540"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06540-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,15]]},"assertion":[{"value":"14 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"7"}}