Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/862
Title: | A binary artificial bee colony algorithm and its performance assessment | Authors: | Kıran, Mustafa Servet | Keywords: | Artificial Bee Colony Binary Optimization Xor Logic Gate Stigmergy Optimization Operator |
Publisher: | PERGAMON-ELSEVIER SCIENCE LTD | Abstract: | Artificial bee colony algorithm, ABC for short, is a swarm-based optimization algorithm proposed for solving continuous optimization problems. Due to its simple but effective structure, some binary versions of the algorithm have been developed. In this study, we focus on modification of its xor-based binary version, called as binABC. The solution update rule of basic ABC is replaced with a xor logic gate in binABC algorithm, and binABC works on discretely-structured solution space. The rest of components in binABC are the same as with the basic ABC algorithm. In order to improve local search capability and convergence characteristics of binABC, a stigmergic behavior-based update rule for onlooker bees of binABC and extended version of xor-based update rule are proposed in the present study. The developed version of binABC is applied to solve a modern benchmark problem set (CEC2015). To validate the performance of proposed algorithm, a series of comparisons are conducted on this problem set. The proposed algorithm is first compared with the basic ABC and binABC on CEC2015 set. After its performance validation, six binary versions of ABC algorithm are considered for comparison of the algorithms, and a comprehensive comparison among the state-of-art variants of swarm intelligence or evolutionary computation algorithms is conducted on this set of functions. Finally, an uncapacitated facility location problem set, a pure binary optimization problem, is considered for the comparison of the proposed algorithm and binary variants of ABC algorithm. The experimental results and comparisons show that the proposed algorithm is successful and effective in solving binary optimization problems as its basic version in solving continuous optimization problems. | URI: | https://doi.org/10.1016/j.eswa.2021.114817 https://hdl.handle.net/20.500.13091/862 |
ISSN: | 0957-4174 1873-6793 |
Appears in Collections: | Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
Files in This Item:
File | Size | Format | |
---|---|---|---|
1-s2.0-S095741742100258X-main.pdf Until 2030-01-01 | 2.97 MB | Adobe PDF | View/Open Request a copy |
CORE Recommender
SCOPUSTM
Citations
5
checked on Apr 20, 2024
WEB OF SCIENCETM
Citations
15
checked on Apr 20, 2024
Page view(s)
92
checked on Apr 15, 2024
Download(s)
6
checked on Apr 15, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.