Remanufacturing prolongs the life cycle and increases the residual value of various end-of-life (EoL) products. As an inevitable process in remanufacturing, disassembly plays an essential role in retrieving the high-value and useable components of EoL products. To disassemble massive quantities and multi-types of EoL products, disassembly lines are introduced to improve the cost-effectiveness and efficiency of the disassembly processes. In this context, disassembly line balancing problem (DLBP) becomes a critical challenge that determines the overall performance of disassembly lines. Currently, the DLBP is mostly studied in straight disassembly lines using single-objective optimization methods, which cannot represent the actual disassembly environment. Therefore, in this paper, we extend the mathematical model of the basic DLBP to stochastic parallel complete disassembly line balancing problem (DLBP-SP). A novel simulated annealing-based hyper-heuristic algorithm (HH) is proposed for multi-objective optimization of the DLBP-SP, considering the number of workstations, working load index, and profits. The feasibility, superiority, stability, and robustness of the proposed HH algorithm are validated through computational experiments, including a set of comparison experiments and a case study of gearboxes disassembly. To the best of our knowledge, this research is the first to introduce gearboxes as a case study in DLBP which enriches the research on disassembly of industrial equipment.
Bibliographical noteCopyright © 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
This research was funded by RECLAIM project ‘Remanufacturing and Refurbishment of Large Industrial Equipment’ and received funding from the European Commission Horizon 2020 research and innovation programme under Grant Agreement No. 869884.
- disassembly line balancing problem
- hyper-heuristic algorithm
- multi-objective optimisation