scholarly journals A general approach to optimize disassembly sequence planning based on disassembly network: A case study from automotive industry

2017 ◽  
Vol 12 (4) ◽  
pp. 305-320 ◽  
Author(s):  
B. Yu ◽  
E. Wu ◽  
C. Chen ◽  
Y. Yang ◽  
B.Z. Yao ◽  
...  
Keyword(s):  
Automotive Industry ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence

scholarly journals Disassembly Sequence Planning (DSP) Applied to a Gear Box: Comparison between Two Literature Studies

2020 ◽  
Vol 10 (13) ◽  
pp. 4591 ◽  
Author(s):  
Leonardo Frizziero ◽  
Alfredo Liverani
Keyword(s):  
Three Dimensional ◽  
Evaluation Criteria ◽  
Three Dimensional Model ◽  
Specific Component ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
New Methods ◽  
Disassembly Sequence ◽  
Mechanical Products

This work aims to analyze the characteristics and importance that design techniques for disassembly assume in the modern design phase of a mechanism. To this end, the study begins by considering a three-dimensional model of a gear motor, taken from the components of which the overall drawings are arranged and from the relief of those not available. Once the mechanism has been digitally reconstructed, the activity focuses on the study of the optimal disassembly sequence by comparing different methodologies, according to two evaluation criteria—minimizing the time taken and minimizing the number of tool changes necessary to complete the sequence. The main results of the work are (1) defining a standard methodology to improve disassembly sequence planning, (2) finding the best disassembly sequence for the specific component among the literature and eventually new methods, and (3) offering to the industrial world a way to optimize maintenance operations in mechanical products. Referring to the limitation of the present works, it can be affirmed that the results are limited to the literature explored and to the case study examined.

scholarly journals Electric Vehicle Battery Disassembly Sequence Planning Based on Frame-Subgroup Structure Combined with Genetic Algorithm

2020 ◽  
Vol 6 ◽  
Author(s):  
Qingdi Ke ◽  
Peng Zhang ◽  
Lei Zhang ◽  
Shouxu Song
Keyword(s):  
Genetic Algorithm ◽  
Electric Vehicle ◽  
Solution Space ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Subgroup Structure ◽  
Disassembly Sequence ◽  
Electric Vehicle Battery ◽  
Crossover And Mutation

Since the electric vehicle battery (EVB) is wildly recycled in industry, the disassembly procedures of variable EVBs is so important that can influence the efficiency and environmental impacts in remanufacturing. To improve disassembly efficiency in EVB remanufacturing, a disassembly sequence planning method based on frame-subgroup structure is proposed in this paper. Firstly, the improved disassembly relation hybrid graph and disassembly relation matrix are proposed to identify the disassembly precedence relationship and connection relationship between the components in EVB. Secondly, the frame - subgroup structure is given, and the method for solving disassembly sequence planning with frame-subgroup structure and genetic algorithm is introduced. In this method, to simplify the series of processes such as encoding, decoding, crossover and mutation, the solution space composed of all disassembly sequences is transformed into the positive integer sequence for the disassembly efficiency in battery remanufacturing. Finally, the case study of EVB disassembly sequence planning is presented to validate the feasibility of this proposed method. Comparing with other traditional methods, the advantage and application of this proposed method are introduced.

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.

Research on the Disassembly Sequence Planning for Mechanical Product

2011 ◽  
Vol 80-81 ◽  
pp. 1300-1304 ◽  
Author(s):  
Shi Jie Su ◽  
Xi Feng Fang ◽  
Fang Li
Keyword(s):  
Directed Graph ◽  
Graph Algorithm ◽  
Lubricating Oil ◽  
Prototype System ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
3D Cad ◽  
Disassembly Sequence ◽  
Mechanical Products

Mechanical products have been inevitably disassembled when they are regarded to be recycled or repaired. The disassembling procedure must be decided no matter what way is used to disassemble. The key is to decide the disassembly sequence for parts/components. In order to generate the disassembly sequence rapidly and correctly, similar thread binary tree and graph algorithm are used to establish the model of disassembly after analyzing the characteristics of Mechanical products. Firstly, generate the related matrix obtained from the 3D CAD assembly model; secondly, transform the undirected graph to the directed graph based on the practical constraints between parts/components; finally, search the restrictions among the directed graph and generate the efficient disassembly sequence. A prototype system of disassembly sequence planning based on UG was implemented which has the functions such as parts and assembly information extraction, definition constraints between components, disassembly sequence planning and etc. The centrifugal lubricating oil filter case study proves the validity and feasibility of the proposed method.

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