Product disassembly sequence planning: state-of-the-art, challenges, opportunities and future directions

2021 ◽  
pp. 1-16
Author(s):  
S. K. Ong ◽  
M. M. L. Chang ◽  
A. Y. C. Nee
Keyword(s):  
State Of The Art ◽  
Future Directions ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
Product Disassembly

scholarly journals Disassembly Sequence Planning for Intelligent Manufacturing Using Social Engineering Optimizer

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 663
Author(s):  
Cheng Zhang ◽  
Amir Mohammad Fathollahi-Fard ◽  
Jianyong Li ◽  
Guangdong Tian ◽  
Tongzhu Zhang
Keyword(s):  
Fitness Function ◽  
Evaluation Criteria ◽  
Social Engineering ◽  
Optimization Methods ◽  
Intelligent Manufacturing ◽  
Constraint Matrix ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
Product Disassembly

Product disassembly and recycling are important issues in green design. Disassembly sequence planning (DSP) is an important problem in the product disassembly process. The core idea is to generate the best or approximately optimal disassembly sequence to reduce disassembly costs and time. According to the characteristics of the DSP problem, a new algorithm to solve the DSP problem is proposed. Firstly, a disassembly hybrid graph is introduced, and a disassembly constraint matrix is established. Secondly, the disassembling time, replacement frequency of disassembly tool and replacement frequency of disassembly direction are taken as evaluation criteria to establish the product fitness function. Then, an improved social engineering optimizer (SEO) method is proposed. In order to enable the algorithm to solve the problem of disassembly sequence planning, a swap operator and swap sequence are introduced, and steps of the social engineering optimizer are redefined. Finally, taking a worm reducer as an example, the proposed algorithm is used to generate the disassembly sequence, and the influence of the parameters on the optimization results is analyzed. Compared with several heuristic intelligent optimization methods, the effectiveness of the proposed method is verified.

A genetic algorithm for product disassembly sequence planning

2008 ◽  
Vol 71 (13-15) ◽  
pp. 2720-2726 ◽  
Author(s):  
Wang Hui ◽  
Xiang Dong ◽  
Duan Guanghong
Keyword(s):  
Genetic Algorithm ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
Product Disassembly

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

2019 ◽  
Vol 234 (3) ◽  
pp. 513-526
Author(s):  
Nan Zhang ◽  
Zhenyu Liu ◽  
Chan Qiu ◽  
Jin Cheng ◽  
Jianrong Tan
Keyword(s):  
Numerical Experiments ◽  
State Of The Art ◽  
Computational Time ◽  
Planning Problem ◽  
Optimal Solutions ◽  
Construction Process ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
High Level

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.

Connector-link-part-based disassembly sequence planning

2021 ◽  
pp. 1063293X2110509
Author(s):  
Hwai-En Tseng ◽  
Chien-Cheng Chang ◽  
Shih-Chen Lee ◽  
Cih-Chi Chen
Keyword(s):  
Basic Unit ◽  
Cost Calculation ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Functional Perspective ◽  
Reference Information ◽  
Disassembly Sequence ◽  
Knowledge Intensive ◽  
The Cost ◽  
Product Disassembly

Under the trend of concurrent engineering, the correspondence between functions and physical structures in product design is gaining importance. Between the functions and parts, connectors are the basic unit for engineers to consider. Moreover, the relationship between connector-liaison-part will help accomplish the integration of information. Such efforts will help the development of the Knowledge Intensive CAD (KICAD) system. Therefore, we proposed a Connector-liaison-part-based disassembly sequence planning (DSP) in this study. First, the authors construct a release diagram through an interference relationship to express the priority of disassembly between parts. The release diagram will allow designers to review the rationality of product disassembly planning. Then, the cost calculation method and disassembly time matrix are established. Last, the greedy algorithm is used to find an appropriate disassembly sequence and seek suggestions for design improvement. Through the reference information, the function and corresponding modules are improved, from which the disassembly value of a product can be reviewed from a functional perspective. In this study, a fixed support holder is used as an example to validate the proposed method. The discussion of the connector-liaison-part will help the integration of the DSP and the functional connector approach.

Sign in / Sign up

Export Citation Format

Share Document