Disassembly sequence planning using a fast and effective precedence-based disassembly subset-generation method

Abstract

Disassembly sequence planning plays a crucial role in the reuse and remanufacturing of end-of-life products. However, it is challenging to obtain optimal disassembly sequences as it is a difficult non-deterministic polynomial-time–hard combinatorial optimisation problem. This study proposes a precedence-based disassembly subset-generation method to solve the disassembly sequence-planning problem. The proposed method first generates disassembly subsets based on disassembly precedence relationships. Subsequently, multiple high-level feasible subsets are generated, and some of them are selected to generate higher level subsets using specially designed operators. After several iterations, different optimal disassembly sequences can be obtained. The principal merit of this method is that high-quality disassembly sequences can be generated in the solution construction process. Numerical experiments were conducted by applying the proposed method to three case studies, and the performance of the proposed method for finding optimal solutions and reducing computational time was evaluated in comparison with state-of-the-art methods. The parameters employed in this method were also analysed to explain the mechanism adopted.

A systematic approach in remanufacturing for high efficiency and low cost: The selective parallel disassembly sequence planning

“…Note that ADT and ADC are related to x and d, and they are obtained by simulating a sample group with a certain scale (computing of indicators involving decoding method in section Solution decoding and evaluation). Then, the indicators of the solution can be processed by equation (10) to achieve normalisation.…”

“…Lu et al 9 developed an SDSP method based on an ant colony algorithm for optimisation involving several objectives: direction, tool change and operation type. Zhang et al 10 proposed a precedence-based disassembly subset method for SDSP and iteration for additional process optimisation, including tool and direction change. Compared with SDSP, PDSP uses multiple manipulators to reduce the disassembly time and shorten the disassembly process but complicate the addition process.…”

“…There are many studies in this area. For example, the literature 7,9,10 belongs to the category of CDSP. In addition, Zhang et al 11 based on a GA to optimise disassembly time and carbon emission in CDSP.…”

Objective Disassembly Sequence Planning of Used Mobile Phones Based on Improved Hybrid Graph Disassembly Model

“…Ren et al [15]proposed a parallel sequence generation model and used the bee colony algorithm for optimization. Zhang et al [16] generated the pre-set and subsequent sets of each part and generated feasible disassembly sequences accordingly. Tseng et al [17] took the disassembly direction and the conversion times of disassembly tools as the objective function and proposed a new flatworm algorithm for optimization.…”

Connector-link-part-based disassembly sequence planning

“…In the past research, researchers focused on the generation of connector-based disassembly sequences. In recent years, researchers have proposed many related novel approaches, such as ontology-based disassembly knowledge representation (Jiang et al, 2018), the subset-generation method (Zhang et al, 2019), the hybrid conjugated method for assembly sequence generation and exploded view generation (Bahubalendruni et al, 2019), the Safe Disposal of End-of-Life model for electric and electronic equipment (Bahubalendruni et al, 2020), a novel geometric feasibility method (Kumar et al, 2021a), a multi-layered disassembly sequence planning method (Kumar et al, 2021b), Automated Disassembly Sequence Prediction for Industry 4.0 (Gulivindala et al, 2021), and a novel approach using stability graph cut-set method (Gunji et al, 2021). However, the interrelationships between connectors, liaisons, and parts have not been further explored.…”