An efficient m-step lookahead rollout algorithm for profit-oriented selective disassembly sequence planning with operation stochastic failure

作     者：Ren, Yaping Meng, Leilei Tian, Guangdong Li, Zhiwu Li, Yun 

作者机构：Beijing Inst Technol Zhuhai 519088 Peoples R China Greater Bay Area Innovat Res Inst BIT Zhuhai 519088 Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252000 Peoples R China Beijing Univ Civil Engn & Architecture Sch Mech Elect & Vehicle Engn Beijing 100044 Peoples R China Xidian Univ Sch Electromech Engn Xian 710071 Peoples R China Macau Univ Sci & Technol Inst Syst Engn Taipa 999078 Peoples R China Univ Elect Sci & Technol China Ind Artificial Intelligence Ctr Inst Adv Study Shenzhen 518110 Peoples R China 

出 版 物：《ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE》 (Eng Appl Artif Intell)

年 卷 期：2025年第145卷

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Funds for National Natural Science Foundation of China [52205526, 52205529] Foundation of State Key Laboratory of Public Big Data [QJJ 418] Fundamental Research Funds for the Central Universities 

主　　题：Selective disassembly planning Profit-oriented Operation stochastic failure Lookahead decision rule Rollout algorithm 

摘      要：To fully reclaim large amounts of used electro-mechanic products, an effective and high-quality disassembly sequence is crucial that separates a product into parts/components one-by-one for recovery. However, it becomes rather challenging to efficiently determine the optimal/near-optimal disassembly sequence for used products since the quality conditions of used products are uncertain and disassembly operations that constitute the disassembly sequence might fail. In this paper, the stochastic failure characteristics of disassembly operations is taken into account and a selective disassembly sequence planning is studied for maximizing the recovering profit of used products. First, we formally model a profit-oriented selective disassembly sequence planning with operation stochastic failure (PSDSP-OSF), in which the expected recovering profit of a disassembly sequence is formulated based on the stochastic failure characteristics of disassembly operations. Then, we simplify and reformulate PSDSP-OSF according to the disassembly rule. A m-step lookahead rollout algorithm is proposed to efficiently solve PSDSP-OSF, in which every disassembly operation is selected by a lookahead decision rule that looking ahead from the current decision stage to future m decision stages. Finally, three different scales of products are selected as case studies and two well-known existing methods are employed to compare with the proposed approach. The computational results demonstrate that our proposed approach is significantly superior to the existing methods in solution quality, computational efficiency, and algorithm robustness.