.png){kind=icon}
Return
Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2013.06.067.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Product recovery
Disassembly
Sequence-dependent disassembly line balancing
Combinatorial optimization
Metaheuristics
Artificial bee colony
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSaveCooperator selection and industry assignment in supply chain network with line balancing technology
PREAI
ShareSaveShareSave
View more