Dual-Objective Program and Scatter Search for the Optimization of Disassembly Sequences Subject to Multiresource Constraints

• Published in: IEEE transactions on automation science and engineering Vol. 15; no. 3; pp. 1091 - 1103
• Main Authors: Guo, Xiwang, Liu, Shixin, Zhou, MengChu, Tian, Guangdong
• Format: Journal Article
• Language: English
• Published: IEEE 01.07.2018
• Subjects: Adaptation models; Disassembly; genetic local search (GLS); Genetics; modeling and simulation; Optimization; Planning; scatter search (SS); Search problems; Uncertainty
• DOI: 10.1109/TASE.2017.2731981
• ISSN: 1545-5955

The effective dismantling of discarded products regardless being used or not is critically important to their reuse, recovery, and recycling. However, the existing product disassembly planning methods pay little or no attention to resource constraints, e.g., limited numbers of disassembly operators and tools. Thus, a resulting plan when being executed may be ineffective in practice. This paper presents a dual-objective optimization model for selective disassembly sequences by considering multiresource constraints such that disassembly profit is maximized and time is minimized. A scatter search is adopted to solve the proposed dual-objective optimization model. It embodies the generation of diverse initial solutions, global assessment of objective functions, a crossover combination operator, a local search strategy for improved solutions, and a reference set update method. To analyze the effect of different weights on its performance, simulations are conducted on different products. Its effectiveness is verified by comparing its optimization results and those of genetic local search. Note to Practitioners -This work deals with a sequence modeling and planning problem of product disassembly. It establishes a novel dual-objective optimization model for product disassembly subject to multiresource constraints. Previously, such a problem is handled through a methodology based on the optimization of a single objective, i.e., disassembly time or cost. The resultant solution is insufficient without fully considering disassembly resources, e.g., labors and tools. Also, in an actual disassembly process, a decision-maker may want to maximize disassembly profit, as well as minimize disassembly time. This work considers both objectives and proposes scatter search to solve disassembly problems. The results demonstrate that the proposed approach can solve them effectively. The obtained solutions give decision makers some desired choices to select a right disassembly process when an actual product is disassembled.