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

2021 ◽  
Author(s):  
Fengfu Yin ◽  
Xiaodong Wang ◽  
Hongrui Li ◽  
Huadong Sun ◽  
Suiran Yu ◽  
...  
Keyword(s):  
Environmental Pollution ◽  
Mobile Phone ◽  
Mobile Phones ◽  
Ant Colony Algorithm ◽  
Experimental Results ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Process ◽  
Disassembly Sequence ◽  
Disassembly Time

Abstract To solve the problems of environmental pollution and waste of resources caused by used mobile phones, the study of objective disassembly sequence planning is carried out for used mobile phones. In view of the connection of mobile phone parts with multiple parts and the need to disassemble components, the concepts of containment, exclusion, and components are integrated into the hybrid graph. An improved hybrid graph is proposed and the improved hybrid graph disassembly model suitable for mobile phone disassembly is established. The ant colony algorithm is used to search for the optimal disassembly sequence, with the objective of minimum disassembly time. Finally, the improved hybrid graph disassembly model is applied to obtain the disassembly solution of HUAWEI Honor 6. The experimental results demonstrate that the disassembly sequence generated by the improved hybrid graph disassembly model can describe the actual disassembly process of disassembling components with less disassembly time.

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).

Disassembly Process Planning Tradeoffs for Product Maintenance

2010 ◽  
Author(s):  
Sara Behdad ◽  
Deborah Thurston
Keyword(s):  
Linear Programming ◽  
Heating System ◽  
Solar Heating ◽  
Multiattribute Utility ◽  
Utility Analysis ◽  
Disassembly Sequence Planning ◽  
Disassembly Process ◽  
Disassembly Sequence ◽  
Multiattribute Utility Analysis ◽  
Disassembly Time

The problem addressed in this paper is disassembly sequence planning for the purposes of maintenance or component upgrading, which is an integral part of the remanufacturing process. This involves disassembly, component repair or replacement, and reassembly. Each of these steps incurs cost as well as the probability of damage during the process. This paper presents a method for addressing these tradeoffs, as well as the uncertainty associated with them. A procedure for identifying the best sequence of disassembly operations for maintenance and/or component upgrade is presented. It considers both disassembly and reassembly costs and uncertainties. Graph-based integer linear programming combined with multiattribute utility analysis is employed to identify the best set of tradeoffs among (a) disassembly time (and resulting cost) under uncertainty, (b) the probability of not incurring damage during disassembly, (c) reassembly time (and resulting cost) and (d) the probability of not incurring damage during reassembly. An example of a solar heating system is used to illustrate the method.

Disassembly and Reassembly Sequence Planning Tradeoffs Under Uncertainty for Product Maintenance

2012 ◽  
Vol 134 (4) ◽  
Author(s):  
Sara Behdad ◽  
Deborah Thurston
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Heating System ◽  
Solar Heating ◽  
Utility Analysis ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
Disassembly Time

The problem addressed in this paper is disassembly sequence planning for the purposes of maintenance or component upgrading, which is an integral part of the remanufacturing process. This involves disassembly, component repair or replacement, and reassembly. Each of these steps incurs cost as well as the probability of damage during the process. This paper presents a method for addressing these tradeoffs, as well as the uncertainty associated with them. A procedure for identifying the best sequence of disassembly operations for maintenance and/or component upgrade is presented. It considers both disassembly and reassembly costs and uncertainties. Graph-based integer linear programming combined with multi-attribute utility analysis is employed to identify the best set of tradeoffs among (a) disassembly time (and resulting cost) under uncertainty, (b) the probability of not incurring damage during disassembly, (c) reassembly time (and resulting cost), and (d) the probability of not incurring damage during reassembly. An example of a solar heating system is used to illustrate the method.

Disassembly sequence planning based on a genetic algorithm

2014 ◽  
Vol 229 (12) ◽  
pp. 2281-2290 ◽  
Author(s):  
Maroua Kheder ◽  
Moez Trigui ◽  
Nizar Aifaoui
Keyword(s):  
Genetic Algorithm ◽  
Research Literature ◽  
Component Part ◽  
Crucial Issue ◽  
Process Plan ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Process ◽  
Disassembly Sequence ◽  
Complicated Task

Disassembly sequence planning is a relatively new subject and has only recently gained interest in the research literature. Disassembly simulations are important not only for improving product design, but also for maintaining an updated process plan, which becomes a tedious and complicated task given the complexity of today’s mechanisms. The crucial issue, in the generation of disassembly plans, is the rise in the amount of sequences, especially with the increase of the number of parts in the mechanism. For this reason, it is crucial to seek an optimal feasible method for the disassembly process. In this paper, an optimized disassembly process based on a genetic algorithm is proposed. The method takes into account several criteria such as maintainability of usury component, part volume, tools change and the change of disassembly directions. The results obtained demonstrate the satisfactory side of these criteria to identify a feasible disassembly sequence.

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

2021 ◽  
pp. 095440542110410
Author(s):  
Lei Zhang ◽  
Yuanfeng Wu ◽  
Ziqi Li ◽  
Yu Zheng ◽  
Yongqiang Ren ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
High Efficiency ◽  
Low Cost ◽  
Sustainable Manufacturing ◽  
Hybrid Genetic Algorithm ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
Critical Activity ◽  
Disassembly Time

With the growth of environmental awareness, remanufacturing and sustainable manufacturing have become hot issues. Disassembly is the first step and critical activity in remanufacturing. Traditional disassembly sequence planning (DSP) focusses on sequential disassembly. However, it is inefficient for complicated products because only one manipulator is employed to execute disassembly operations. Thus, this work focusses on parallel DSP (PDSP) and proposes a selective parallel disassembly sequence planning (SPDSP) methodology, which performs disassembly compared to sequential DSP and PDSP. In this paper, a mathematical model is used to describe the constraint and precedence relationships, and a parallel sequence model is designed for parallel disassembly. A novel hybrid genetic algorithm (NHGA) based-multi-objective model of SPDSP is proposed for optimisation. In this model, two indicators are integrated: disassembly time (including basic disassembly time, tool exchange time and direction change time) and disassembly costs. A transmission box is used as an instance, and a comparison with conventional genetic algorithm (GA), simulated annealing (SA) and tabu search (TS) is made to validate the practicality of the proposed methodology.

Sign in / Sign up

Export Citation Format

Share Document