2015
DOI: 10.1177/0954406215576063
|View full text |Cite
|
Sign up to set email alerts
|

Bees Algorithm for multimodal function optimisation

Abstract: The aim of multimodal optimisation is to find significant optima of a multimodal objective function including its global optimum. Many real-world applications are multimodal optimisation problems requiring multiple optimal solutions. The Bees Algorithm is a global optimisation procedure inspired by the foraging behaviour of honeybees. In this paper, several procedures are introduced to enhance the algorithm’s capability to find multiple optima in multimodal optimisation problems. In the proposed Bees Algorithm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 37 publications
0
5
0
Order By: Relevance
“…Since its first introduction in 2005 by Professor Pham et al, this algorithm has been widely proposed by many researchers as a powerful optimisation tool to solve several problems in different fields. This is due to the wide spectrum of advantages such as simplicity and efficaciousness [33][34][35][36][37].…”
Section: The Proposed Optimisation Technique and Objective Functionmentioning
confidence: 99%
“…Since its first introduction in 2005 by Professor Pham et al, this algorithm has been widely proposed by many researchers as a powerful optimisation tool to solve several problems in different fields. This is due to the wide spectrum of advantages such as simplicity and efficaciousness [33][34][35][36][37].…”
Section: The Proposed Optimisation Technique and Objective Functionmentioning
confidence: 99%
“…In these sections, many searches are made in the neighborhood of optimum solutions, similar to doing guidance with real bees dance. In addition, random searches continue in the global search section, thus avoiding local optimum values [25]. The problem in this study is in combinatorial structure.…”
Section: The Online Bees Algorithmmentioning
confidence: 99%
“…The pseudo code for the algorithm is shown in its simplest form in Figure 6. As detailed in leading studies, [33][34][35][36][37][38][39][40][41] the algorithm requires a number of parameters to be set, namely: number of scout bees (n), number of sites selected for exploitation out of n visited sites (m), number of top-rated (elite) sites among the m selected sites (e), number of bees recruited for the best e sites (nep), number of recruited for the other (m-e) selected sites (nsp), initial size of each patch (a patch is a region in search space that includes a visited site and its neighbourhood) and stopping criterion is iteration number (itr). The algorithm begins with the n scout bees being placed haphazardly in the search space.…”
Section: The Bees Algorithm and Genetic Algorithm For Pid Controller mentioning
confidence: 99%