TY - GEN
T1 - Multi-objective Discrete Bat Optimizer for Partial U-shaped Disassembly Line Balancing Problem
AU - Huang, Fuguang
AU - Guo, Laide
AU - Guo, Xiwang
AU - Liu, Shixin
AU - Qi, Liang
AU - Qin, Shujin
AU - Zhao, Ziyan
AU - Tang, Ying
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - Just like the assembly line, the disassembly line has a variety of layouts. Selecting a reasonable disassembly line layout according to the disassembly environment is beneficial to improve the disassembly efficiency and reduce the space of the workshop. In order to improve the disassembly efficiency and balance rate, a U-shaped disassembly model is established to maximize disassembly profit and minimize disassembly energy consumption. The model focuses on the harmful risks of dismantling components. Robotic disassembly is the choice for those with higher risks, while manual disassembly is the choice for those with lower risks. In order to solve the balance problem of a U-shaped disassembly line, a multi-objective discrete Bat algorithm is proposed, which can provide a feasible solution for decision- makers. In order to verify the characteristics of the algorithm, we performed comparison with the current popular migratory bird optimization algorithm, artificial bee colony algorithm, non-dominated sorting genetic algorithm, and the decomposition-based multi-objective evolutionary algorithm. The experimental results show that the proposed algorithm is a good chioce to solve this problem. It has a strong search ability.
AB - Just like the assembly line, the disassembly line has a variety of layouts. Selecting a reasonable disassembly line layout according to the disassembly environment is beneficial to improve the disassembly efficiency and reduce the space of the workshop. In order to improve the disassembly efficiency and balance rate, a U-shaped disassembly model is established to maximize disassembly profit and minimize disassembly energy consumption. The model focuses on the harmful risks of dismantling components. Robotic disassembly is the choice for those with higher risks, while manual disassembly is the choice for those with lower risks. In order to solve the balance problem of a U-shaped disassembly line, a multi-objective discrete Bat algorithm is proposed, which can provide a feasible solution for decision- makers. In order to verify the characteristics of the algorithm, we performed comparison with the current popular migratory bird optimization algorithm, artificial bee colony algorithm, non-dominated sorting genetic algorithm, and the decomposition-based multi-objective evolutionary algorithm. The experimental results show that the proposed algorithm is a good chioce to solve this problem. It has a strong search ability.
UR - http://www.scopus.com/inward/record.url?scp=85127536764&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85127536764&partnerID=8YFLogxK
U2 - 10.1109/ICCSI53130.2021.9736232
DO - 10.1109/ICCSI53130.2021.9736232
M3 - Conference contribution
AN - SCOPUS:85127536764
T3 - 2021 International Conference on Cyber-Physical Social Intelligence, ICCSI 2021
BT - 2021 International Conference on Cyber-Physical Social Intelligence, ICCSI 2021
A2 - Wang, Jiacun
A2 - Tang, Ying
A2 - Wang, Fei-Yue
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 International Conference on Cyber-Physical Social Intelligence, ICCSI 2021
Y2 - 18 December 2021 through 20 December 2021
ER -