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

被引:1
作者
Zhang, Qi [1 ]
Xu, Bin [1 ]
Yao, Man [2 ]
Wang, Jiacun [3 ]
Guo, Xiwang [4 ]
Qin, Shujin [5 ]
Qi, Liang [6 ]
Lu, Fayang [4 ]
机构
[1] Shenyang Univ Chem Technol, Coll Informat Engn, Shenyang 110142, Peoples R China
[2] He Univ, Sch Basic Med, Shenyang 110163, Peoples R China
[3] Monmouth Univ, Dept Comp Sci & Software Engn, West Long Branch, NJ 07764 USA
[4] Liaoning Petrochem Univ, Coll Informat & Control Engn, Fushun 113001, Peoples R China
[5] Shangqiu Normal Univ, Coll Econ & Management, Shangqiu 476000, Peoples R China
[6] Shandong Univ Sci & Technol, Dept Comp Sci & Technol, Qingdao 266590, Peoples R China
关键词
human-robot collaborative disassembly; parallel disassembly line; improved moth-flame algorithm; OPTIMIZATION ALGORITHM;
D O I
10.3390/math12060816
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页数:17
相关论文
共 34 条
[1]  
Chen Q., 2020, P INT MANUFACTURING, VVolume 2, DOI [10.1115/MSEC2020-8268, DOI 10.1115/MSEC2020-8268]
[2]   Quantum-Inspired Moth-Flame Optimizer With Enhanced Local Search Strategy for Cluster Analysis [J].
Cui, Xinrong ;
Luo, Qifang ;
Zhou, Yongquan ;
Deng, Wu ;
Yin, Shihong .
FRONTIERS IN BIOENGINEERING AND BIOTECHNOLOGY, 2022, 10
[3]  
Dao SD, 2016, ENG LET, V24, P75
[4]   Multi-Objective Home Health Care Routing and Scheduling With Sharing Service via a Problem-Specific Knowledge-Based Artificial Bee Colony Algorithm [J].
Fu, YaPing ;
Ma, XiaoMeng ;
Gao, KaiZhou ;
Li, ZhiWu ;
Dong, HongYu .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2024, 25 (02) :1706-1719
[5]   Two-objective stochastic flow-shop scheduling with deteriorating and learning effect in Industry 4.0-based manufacturing system [J].
Fu, Yaping ;
Ding, Jinliang ;
Wang, Hongfeng ;
Wang, Junwei .
APPLIED SOFT COMPUTING, 2018, 68 :847-855
[6]   Complications in disassembly line balancing [J].
Güngör, A ;
Gupta, SM ;
Pochampally, K ;
Kamarthi, SV .
ENVIRONMENTALLY CONSCIOUS MANUFACTURING, 2001, 4193 :289-298
[7]   A solution approach to the disassembly line balancing problem in the presence of task failures [J].
Güngör, A ;
Gupta, SM .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (07) :1427-1467
[8]   Stochastic Hybrid Discrete Grey Wolf Optimizer for Multi-Objective Disassembly Sequencing and Line Balancing Planning in Disassembling Multiple Products [J].
Guo, Xiwang ;
Zhang, Zhiwei ;
Qi, Liang ;
Liu, Shixin ;
Tang, Ying ;
Zhao, Ziyan .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2022, 19 (03) :1744-1756
[9]   A network-based shortest route model for parallel disassembly line balancing problem [J].
Hezer, Seda ;
Kara, Yakup .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (06) :1849-1865
[10]   An experimental human-robot collaborative disassembly cell [J].
Huang, Jun ;
Pham, Duc Truong ;
Li, Ruiya ;
Qu, Mo ;
Wang, Yongjing ;
Kerin, Mairi ;
Su, Shizhong ;
Ji, Chunqian ;
Mahomed, Omar ;
Khalil, Riham ;
Stockton, David ;
Xu, Wenjun ;
Liu, Quan ;
Zhou, Zude .
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 155