Lexicographic Multiobjective Scatter Search for the Optimization of Sequence-Dependent Selective Disassembly Subject to Multiresource Constraints

Industrial products' reuse, recovery, and recycling are very important because of their environmental and economic benefits. Effective product disassembly planning methods can improve their recovery efficiency and reduce their bad environmental impact. However, the existing approaches pay littl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on cybernetics Ročník 50; číslo 7; s. 3307 - 3317
Hlavní autoři: Guo, Xiwang, Zhou, Mengchu, Liu, Shixin, Qi, Liang
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States IEEE 01.07.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2168-2267, 2168-2275, 2168-2275
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Industrial products' reuse, recovery, and recycling are very important because of their environmental and economic benefits. Effective product disassembly planning methods can improve their recovery efficiency and reduce their bad environmental impact. However, the existing approaches pay little attention to sequence-dependent disassembly with resource constraints, such as limited disassembly operators and tools, which makes the current planning methods ineffective in practice. This paper considers a multiobjective resource-constrained and sequence-dependent disassembly optimization problem with disassembly precedence constraints. Energy consumption is adopted to evaluate the disassembly efficiency. Its use with traditional optimization criterion leads to a novel multiobjective optimization model such that the energy consumption and disassembly time are minimized while disassembly profit is maximized. Since the problem complexity increases with the number of components in a product, a lexicographic multiobjective scatter search (SS) method is proposed to solve the proposed multiobjective optimization problem. Its effectiveness is verified by comparing the results of linear weight SS and genetic algorithms. The results show that it is able to provide a better solution in a short execution time and fulfills the precedence requirement in a product structure and resource constraints.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2168-2267
2168-2275
2168-2275
DOI:10.1109/TCYB.2019.2901834