Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm
AbstractIn many non-deterministic search algorithms, particularly those analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. The BA is a population-based metaheuristic search algorithm inspired by bees seeking nectar/pollen. 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 well-known 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 more quickly. View Full-Text
Share & Cite This Article
Nasrinpour, H.R.; Bavani, A.M.; Teshnehlab, M. Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm. Computers 2017, 6, 5.
Nasrinpour HR, Bavani AM, Teshnehlab M. Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm. Computers. 2017; 6(1):5.Chicago/Turabian Style
Nasrinpour, Hamid R.; Bavani, Amir M.; Teshnehlab, Mohammad. 2017. "Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm." Computers 6, no. 1: 5.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.