Preserved in Portico This version is not peer-reviewed
Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm
: Received: 13 November 2016 / Approved: 14 November 2016 / Online: 14 November 2016 (04:48:54 CET)
A peer-reviewed article of this Preprint also exists.
Journal reference: Computers 2017, 6, 5
As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.
bees algorithm; swarm intelligence; evolutionary optimization; grouped bees algorithm
MATHEMATICS & COMPUTER SCIENCE, Artificial Intelligence & Robotics
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.