A disassembly Sequence Planning Approach for maintenance

2016 ◽  
pp. 81-89 ◽  
Author(s):  
Maroua Kheder ◽  
Moez Trigui ◽  
Nizar Aifaoui
Keyword(s):  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Planning Approach ◽  
Disassembly Sequence

A Hybrid Disassembly Sequence Planning Approach for Maintenance

2002 ◽  
Vol 2 (1) ◽  
pp. 28-37 ◽  
Author(s):  
J. R. Li , ◽  
S. B. Tor , and ◽  
L. P. Khoo
Keyword(s):  
Fitness Function ◽  
Hybrid Approach ◽  
Search Space ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Constraint Graph ◽  
Planning Approach ◽  
Disassembly Sequence

This paper describes a hybrid approach to handle disassembly sequence planning for maintenance. The product under maintenance is first modeled using a novel hybrid graph known as Disassembly Constraint Graph (DCG) which embodies complete disassembly information and can be used to prune the search space of disassembly sequences. Subsequently, a novel Tabu-enhanced GA engine is invoked to generate the near optimal disassembly sequences. A case study was used to illustrate the effectiveness of the proposed approach. The details of the DCG, the TS-enhanced GA engine and the fitness function used are presented in this paper.

A disassembly sequence planning approach with an advanced immune algorithm

2012 ◽  
Vol 226 (11) ◽  
pp. 2739-2749 ◽  
Author(s):  
Cong Lu ◽  
Ya-Chao Liu
Keyword(s):  
Single Parent ◽  
Immune Algorithm ◽  
Planning Problem ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Planning Approach ◽  
Disassembly Sequence ◽  
Support Matrix ◽  
The Stability

This article proposes a disassembly sequence planning approach with an advanced immune algorithm. First, an enhanced support matrix considering the fasteners is constructed to represent the stability of a product, by which the method to derive the stability of parts in the product is given, and this stability is considered as one of the evaluation objectives in disassembly sequence planning. Second, the immune algorithm is improved to solve the disassembly sequence planning problem, where, a multiple single-parent mutation method is used to replace the crossover; two kinds of vaccines are extracted in two ways and inoculated with different probabilities, and the elite metabolism is used to ensure the effectiveness of the antibodies and also maintain the diversity of the population. Finally, the influence of different factors such as the vaccine extraction interval, the inoculation probability, elite metabolism probability on the evolution performance of the algorithm is investigated, and the validity of the proposed approach is verified through a case study.

A multi-layered disassembly sequence planning method to support decision making in de-manufacturing

Sadhana ◽  
2021 ◽  
Vol 46 (2) ◽  
Author(s):  
Gulivindala Anil Kumar ◽  
M V A Raju Bahubalendruni ◽  
V S S Prasad ◽  
K Sankaranarayanasamy
Keyword(s):  
Decision Making ◽  
Planning Method ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
Support Decision Making

ASSEMBLY/DISASSEMBLY SEQUENCE PLANNING

1992 ◽  
Vol 12 (3) ◽  
pp. 31-38 ◽  
Author(s):  
K. Yokota ◽  
D.R. Brough
Keyword(s):  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence

Partial/Parallel Disassembly Sequence Planning for Complex Products

2017 ◽  
Vol 140 (1) ◽  
Author(s):  
Fei Tao ◽  
Luning Bi ◽  
Ying Zuo ◽  
A. Y. C. Nee
Keyword(s):  
Degrees Of Freedom ◽  
Diversity Management ◽  
Disassembly Sequence Planning ◽  
Complex Products ◽  
Sequence Planning ◽  
Modular Product ◽  
Disassembly Sequence ◽  
Comparison Results ◽  
Complex Constraints ◽  
Disassembly Time

Disassembly is a very important step in recycling and maintenance, particularly for energy saving. However, disassembly sequence planning (DSP) is a challenging combinatorial optimization problem due to complex constraints of many products. This paper considers partial and parallel disassembly sequence planning for solving the degrees-of-freedom in modular product design, considering disassembly time, cost, and energy consumption. An automatic self-decomposed disassembly precedence matrix (DPM) is designed to generate partial/parallel disassembly sequence for reducing complexity and improving efficiency. A Tabu search-based hyper heuristic algorithm with exponentially decreasing diversity management strategy is proposed. Compared with the low-level heuristics, the proposed algorithm is more efficient in terms of exploration ability and improving energy benefits (EBs). The comparison results of three different disassembly strategies prove that the partial/parallel disassembly has a great advantage in reducing disassembly time, and improving EBs and disassembly profit (DP).

Sign in / Sign up

Export Citation Format

Share Document