.png){kind=icon}
Return
Binary Artificial Bee Colony optimization using bitwise operation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2014.08.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Artificial Bee Colony (ABC) algorithm has been applied to many scientific and engineering problems for its easy of use and efficiency. However, the original ABC technique cannot be used in a binary search space directly. This paper proposes an effective binary ABC algorithm, or BitABC, that has a similar framework to the original ABC but uses a bitwise operation for the movements of the employed bees and onlooker bees. Experiments have been carried out by comparing BitABC with three binary ABC variants, DisABC, normABC, and BinABC, and the most used binary search technique, GA, on a set of 13 selected benchmark functions. Results show that the proposed BitABC performs better than, or at least comparable to, the other algorithms in terms of the final solution accuracy, convergence speed, and robustness. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Artificial Bee Colony algorithm
Swarm intelligence
Computational intelligence
Genetic Algorithm
Binary optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations
Cited Papers
ShareSaveShareSaveShareSave
ShareSaveNon‐word repetition and literacy in Dutch children at‐risk of dyslexia and children with SLI: results of the follow‐up study.png)
Dyslexia
DyslexiaIF0
PREAI
ShareSave View more