An Improved Moth-Flame Algorithm for Human–Robot Collaborative Parallel Disassembly Line Balancing Problem

Qi Zhang, Bin Xu, Man Yao, Jiacun Wang, Xiwang Guo, Shujin Qin, Liang Qi () and Fayang Lu
Additional contact information
Qi Zhang: College of Information Engineering, Shenyang University of Chemical Technology, Shenyang 110142, China
Bin Xu: College of Information Engineering, Shenyang University of Chemical Technology, Shenyang 110142, China
Man Yao: School of Basic Medicine, He University, Shenyang 110163, China
Jiacun Wang: Department of Computer Science and Software Engineering, Monmouth University, West Long Branch, NJ 07764, USA
Xiwang Guo: College of Information and Control Engineering, Liaoning Petrochemical University, Fushun 113001, China
Shujin Qin: College of Economics and Management, Shangqiu Normal University, Shangqiu 476000, China
Liang Qi: Department of Computer Science and Technology, Shandong University of Science and Technology, Qingdao 266590, China
Fayang Lu: College of Information and Control Engineering, Liaoning Petrochemical University, Fushun 113001, China

Mathematics, 2024, vol. 12, issue 6, 1-17

Abstract: 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.

Keywords: human–robot collaborative disassembly; parallel disassembly line; improved moth-flame algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/6/816/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/6/816/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:6:p:816-:d:1354766

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().