Name
Abstract | ||
|---|---|---|
This paper presents a novel artificial bee colony algorithm for binary optimization in general. Our proposal, named NBABC, features a mechanism which limits the number of dimensions that can be changed in the employed and onlookers bees’ phase. We compare the NBABC to other five binary variants of the continuous ABC, including the state-of-the-art versions for binary optimization, and other four well-known methods. We employ different types of tasks to assess the performance of all the algorithms including the OneMax problem, five variations of the 0/1 Knapsack problems and Feature Selection using eight public datasets. The experiments show that the new proposal obtained competitive results, and in some cases outperformed not only the binary-based ABCs but also the other binary swarm-based and evolutionary-based optimizers. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.future.2019.03.032 | Future Generation Computer Systems |
Keywords | Field | DocType |
Swarm intelligence,Binary optimization,Artificial bee colony (ABC),Knapsack problem,Feature selection | Artificial bee colony algorithm,Feature selection,Swarm behaviour,Computer science,Algorithm,Binary optimization,Knapsack problem,Binary number,Distributed computing | Journal |
Volume | ISSN | Citations |
98 | 0167-739X | 3 |
PageRank | References | Authors |
0.43 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Clodomir J. Santana | 1 | 4 | 1.79 |
| Mariana Macedo | 2 | 5 | 2.50 |
| Hugo Siqueira | 3 | 14 | 3.60 |
| Anu Gokhale | 4 | 4 | 1.45 |
| Carmelo J. A. Bastos-Filho | 5 | 81 | 18.45 |