TY - GEN
T1 - Multi-objective discrete migrating birds optimizer solving multiple-product partial u-shaped disassembly line balancing problem
AU - Qin, Guibin
AU - Guo, Xiwang
AU - Liu, Shixin
AU - Qi, Liang
AU - Zhao, Jian
AU - Zhao, Ziyan
AU - Tang, Ying
N1 - Funding Information:
*This work is supported in Liaoning Province Education Department Scientific Research Foundation of China under Grant No. L2019027; Liaoning Revitalization Talents Program under Grant No. XLYC1907166; Liaoning Province Dr. Research Foundation of China under Grant No. 20170520135. The Natural Science Foundation of Shandong Province sunder Grant ZR2019BF004; National Natural Science Foundation of China (61573089) G. B. Qin and X. W. Guo are with the Computer and Communication Engineering College, Liaoning Petrochemical University, Fushun, 113001, P R. China (e-mail: 1959658200@qq.com, x.w.guo@163.com).
Publisher Copyright:
© 2021 IEEE.
PY - 2021/6/22
Y1 - 2021/6/22
N2 - The disassembly of end-of-life (EOL) products is increasingly inseparable from the disassembly line. Effective disassembly planning and reasonable disassembly line layout can bring significant benefits to the related industry. Considering the requirements of disassembly enterprises for lean production, this work proposes a multiple-product partial U-shaped disassembly-line-balancing (MPUD) problem. In this MPUD problem, multiple different types of EOL products can be disassembled simultaneously on a U-shaped layout disassembly line. A multi-objective MPUD problem is stated to maximize the disassembly profit and minimize disassembly resource consumption. A multi-objective discrete migrating birds optimizer (MDMBO) is designed to solve it. The proposed MDMBO and two others commonly used multi-objective optimization algorithms are compared for practical cases. The calculation results show that MDMBO's practicability and superiority over its two peers.
AB - The disassembly of end-of-life (EOL) products is increasingly inseparable from the disassembly line. Effective disassembly planning and reasonable disassembly line layout can bring significant benefits to the related industry. Considering the requirements of disassembly enterprises for lean production, this work proposes a multiple-product partial U-shaped disassembly-line-balancing (MPUD) problem. In this MPUD problem, multiple different types of EOL products can be disassembled simultaneously on a U-shaped layout disassembly line. A multi-objective MPUD problem is stated to maximize the disassembly profit and minimize disassembly resource consumption. A multi-objective discrete migrating birds optimizer (MDMBO) is designed to solve it. The proposed MDMBO and two others commonly used multi-objective optimization algorithms are compared for practical cases. The calculation results show that MDMBO's practicability and superiority over its two peers.
UR - http://www.scopus.com/inward/record.url?scp=85113692636&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85113692636&partnerID=8YFLogxK
U2 - 10.1109/MED51440.2021.9480304
DO - 10.1109/MED51440.2021.9480304
M3 - Conference contribution
AN - SCOPUS:85113692636
T3 - 2021 29th Mediterranean Conference on Control and Automation, MED 2021
SP - 59
EP - 64
BT - 2021 29th Mediterranean Conference on Control and Automation, MED 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 29th Mediterranean Conference on Control and Automation, MED 2021
Y2 - 22 June 2021 through 25 June 2021
ER -