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

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.

2011 ◽  
Vol 80-81 ◽  
pp. 1300-1304 ◽  
Author(s):  
Shi Jie Su ◽  
Xi Feng Fang ◽  
Fang Li

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.


Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 663
Author(s):  
Cheng Zhang ◽  
Amir Mohammad Fathollahi-Fard ◽  
Jianyong Li ◽  
Guangdong Tian ◽  
Tongzhu Zhang

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.


2020 ◽  
Vol 6 ◽  
Author(s):  
Qingdi Ke ◽  
Peng Zhang ◽  
Lei Zhang ◽  
Shouxu Song

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.


2002 ◽  
Vol 2 (1) ◽  
pp. 28-37 ◽  
Author(s):  
J. R. Li , ◽  
S. B. Tor , and ◽  
L. P. Khoo

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.


2014 ◽  
Vol 34 (1) ◽  
pp. 106-114 ◽  
Author(s):  
Xiaowen Song ◽  
Weidong Zhou ◽  
Xingxing Pan ◽  
Kun Feng

Purpose – To improve the efficiency and economy of electro-mechanical product's recycle process, this paper aims to propose a disassembly sequence planning (DSP) method to reduce additional efforts of removing extra parts in selectable disassembly. Design/methodology/approach – The methodology has three parts, which includes a disassembly hybrid graphic model to describe the product disassembly information, an object inverse-directed method to optimize the disassembly design and a model reconstruction method to achieve a better DSP. Findings – According to the disassembly cost criteria and the parameters of disassembly tools, the disassembly efficiency increases and the disassembly cost decreases due to the use of partial destructive mode compared with non-destructive mode. The proposed partial destructive DSP is more efficient and economical. Research limitations/implications – Partial destructive disassembly mode cannot be used for the flammable or explosive component in the procedure of the DSP optimization algorithm. Practical implications – DSP of an electric corkscrew is analyzed to investigate the accuracy and efficiency of the proposed method. Originality/value – This paper proposes a partial destructive disassembly based DSP method for product disassembly, which provides a new approach for the disposal of end-of-life products.


2013 ◽  
Vol 572 ◽  
pp. 335-339
Author(s):  
Hai Tao Zhu ◽  
Liang Cong

Disassembly Sequence planning is the important module of virtual maintenance. Its foundational task is to test the disassemblability of parts, find out all the feasible disassembly sequences of targeted parts and search for the near-optimal disassembly sequence. In the paper, the spherical algorithm is used to test the disassemblability of parts. And then the disassembly direction of parts is determined by rules which are the simplified version of Gaussian map approach. Thus the near-optimal disassembly sequence is found out by optimizing all feasible disassembly sequences of targeted parts by ant colony algorithm. The simulation result of the sequence optimization proves to be the same with manual calculation considering comprehensive cost of the change of disassembly tools and disassembly directions. The set of approaches can be reference for disassembly sequence planning of large-scale mechanical products.


Author(s):  
Cong Lu ◽  
Ya-Chao Liu

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.


Sadhana ◽  
2021 ◽  
Vol 46 (2) ◽  
Author(s):  
Gulivindala Anil Kumar ◽  
M V A Raju Bahubalendruni ◽  
V S S Prasad ◽  
K Sankaranarayanasamy

Sign in / Sign up

Export Citation Format

Share Document