Solving a Stochastic Multi-Objective Sequence Dependence Disassembly Sequence Planning Problem with an Innovative Bees Algorithm

Abstract

As the number of end-of-life products multiplies, the issue of their efficient disassembly has become a critical problem that urgently needs addressing. The field of disassembly sequence planning has consequently attracted considerable attention. In the actual disassembly process, the complex structures of end-of-life products can lead to significant delays due to the interference between different tasks. Overlooking this can result in inefficiencies and a waste of resources. Therefore, it is particularly important to study the sequence-dependent disassembly sequence planning problem. Additionally, disassembly activities are inherently fraught with uncertainties, and neglecting these can further impact the effectiveness of disassembly. This study is the first to analyze the sequence-dependent disassembly sequence planning problem in an uncertain environment. It utilizes a stochastic programming approach to address these uncertainties. Furthermore, a mixed-integer optimization model is constructed to minimize the disassembly time and energy consumption simultaneously. Recognizing the complexity of the problem, this study introduces an innovative bees algorithm, which has proven its effectiveness by showing a superior performance compared to other state-of-the-art algorithms in various test cases. This research offers innovative solutions for the efficient disassembly of end-of-life products and holds significant implications for advancing sustainable development and the recycling of resources.