An Improved Moth-Flame Algorithm for Human–Robot Collaborative Parallel Disassembly Line Balancing Problem
Mathematics · 11.03.2024 · 12 (6) · 816
DOI: 10.3390/math12060816 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 11.03.2024. Verfasst von Qi Zhang und 7 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NSFC, Liaoning Province Education Department Scientific Research Foundation of China, Natural Science Foundation of Shandong Province.
Abstract (Originalsprache)
In the context of sustainable development strategies, the recycling of discarded products has become increasingly important with the development of electronic technology. Choosing the human–robot collaborative disassembly mode is the key to optimizing the disassembly process and ensuring maximum efficiency and benefits. To solve the problem of human–robot cooperative parallel dismantling line balance, a mixed integer programming model is established and verified by CPLEX. An improved Moth-Flame Optimization (IMFO) algorithm is proposed to speed up convergence and optimize the disassembly process of various products. The effectiveness of IMFO is evaluated through multiple cases and compared with other heuristics. The results of these comparisons can provide insight into whether IMFO is the most appropriate algorithm for the problem presented.
Förderung
- NSFC
- Liaoning Province Education Department Scientific Research Foundation of China
- Natural Science Foundation of Shandong Province
Zitieren
APA
Zhang, Q., Xu, B., Yao, M., Wang, J., Guo, X., Qin, S., Qi, L., & Lu, F. (2024). An Improved Moth-Flame Algorithm for Human–Robot Collaborative Parallel Disassembly Line Balancing Problem. Mathematics, 12(6), 816. https://doi.org/10.3390/math12060816
Vancouver
Zhang Q, Xu B, Yao M, Wang J, Guo X, Qin S, et al. An Improved Moth-Flame Algorithm for Human–Robot Collaborative Parallel Disassembly Line Balancing Problem. Mathematics. 2024;12(6):816. doi:10.3390/math12060816
BibTeX
@article{Zhang2024,
author = {Zhang, Qi and Xu, Bin and Yao, Man and Wang, Jiacun and Guo, Xiwang and Qin, Shujin and Qi, Liang and Lu, Fayang},
title = {An Improved Moth-Flame Algorithm for Human–Robot Collaborative Parallel Disassembly Line Balancing Problem},
journal = {Mathematics},
year = {2024},
volume = {12},
number = {6},
pages = {816},
doi = {10.3390/math12060816}
}
EUVIMED