Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem |
| |
Authors: | Can B. Kalayci Surendra M. Gupta |
| |
Affiliation: | 1. Department of Industrial Engineering, Pamukkale University, Kinikli Kampusu, 20070 Denizli, Turkey;2. 334 SN, Department of Mechanical and Industrial Engineering, Northeastern University, 360 Huntington Avenue, Boston, MA 02115, USA |
| |
Abstract: | ![]() In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that requires the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly precedence constraints and optimizing the effectiveness of several measures. Since the complexity of SDDLBP increases with the number of parts of the product, an efficient methodology based on artificial bee colony (ABC) is proposed to solve the SDDLBP. ABC is an optimization technique which is inspired by the behavior of honey bees. The performance of the proposed algorithm was tested against six other algorithms. The results show that the proposed ABC algorithm performs well and is superior to the other six algorithms in terms of the objective values performance. |
| |
Keywords: | Product recovery Disassembly Sequence-dependent disassembly line balancing Combinatorial optimization Metaheuristics Artificial bee colony |
本文献已被 ScienceDirect 等数据库收录! |
|