Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/8033
Title: | Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem | Authors: | Kalaycı, Can Berk Gupta, S.M. |
Keywords: | Artificial bee colony balancing Combinatorial optimization Disassembly Metaheuristics Product recovery Sequence-dependent disassembly line Artificial bee colonies Disassembly line Meta heuristics Balancing Information systems Mathematical models Evolutionary algorithms |
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. © 2013 Elsevier Ltd. All rights reserved. | URI: | https://hdl.handle.net/11499/8033 https://doi.org/10.1016/j.eswa.2013.06.067 |
ISSN: | 0957-4174 |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
176
checked on Oct 13, 2024
WEB OF SCIENCETM
Citations
145
checked on Dec 19, 2024
Page view(s)
38
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.