Multiverse Optimization Algorithm for Stochastic Biobjective Disassembly Sequence Planning Subject to Operation Failures
Lists
Only you see this
Abstract
Disassembly is an essential step in a remanufacturing process via which valuable parts and material of end-of-life (EOL) products can be well reused and resource waste is reduced. Disassembly sequence planning focuses on finding the best disassembly sequence for a given EOL product by considering economic and environmental performance. In a practical disassembly process, one may face a disassembly operation failure risk due to the difficulty of knowing EOL products’ exact information in advance. Despite its importance in impacting disassembly outcomes, the existing work fails to consider it comprehensively. This work proposes a stochastic biobjective DSP problem with the objectives of maximizing disassembly profit and minimizing energy consumption by doing so. A chance-constrained programming model is established, where a chance constraint ensures a fixed confidence level of disassembly failure. To solve it efficiently, a multiobjective multiverse optimization algorithm with stochastic simulation is proposed. Experiments are carried out on four products. Results demonstrate that it outperforms some state-of-the-art algorithms in terms of solution performance.
BibTeX
@article{fu2022multiverse,
author = {Yaping Fu and MengChu Zhou and Xiwang Guo and Liang Qi and Khaled Sedraoui},
title = {{Multiverse Optimization Algorithm for Stochastic Biobjective Disassembly Sequence Planning Subject to Operation Failures}},
journal = {IEEE Trans. Syst. Man Cybern. Syst.},
year = {2022},
doi = {10.1109/tsmc.2021.3049323},
}Loading related content...