2020
DOI: 10.1016/j.swevo.2020.100746
|View full text |Cite
|
Sign up to set email alerts
|

An analysis of the search mechanisms of the bees algorithm

Abstract: Link to publication on Research at Birmingham portal General rights Unless a licence is specified above, all rights (including copyright and moral rights) in this document are retained by the authors and/or the copyright holders. The express permission of the copyright holder must be obtained for any use of this material other than for purposes permitted by law. • Users may freely distribute the URL that is used to identify this publication. • Users may download and/or print one copy of the publication from th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 43 publications
(70 reference statements)
0
11
0
Order By: Relevance
“…According to this gure, (1) shows the start time of the simulation and the wing is waiting folded position. (2) shows the position of the wing after 40 ms, and at that moment the wing has turned 43 degrees. (3) shows the position of the wing after 71 ms. And the last picture (4) shows the end of turning and the opening position of the wing.…”
Section: Dynamic Analysis Of the Wing Mechanism And Experimental Resultsmentioning
confidence: 99%
“…According to this gure, (1) shows the start time of the simulation and the wing is waiting folded position. (2) shows the position of the wing after 40 ms, and at that moment the wing has turned 43 degrees. (3) shows the position of the wing after 71 ms. And the last picture (4) shows the end of turning and the opening position of the wing.…”
Section: Dynamic Analysis Of the Wing Mechanism And Experimental Resultsmentioning
confidence: 99%
“…The algorithm mimics the nectar source search behavior of honey bees. Basically, it does some kind of neighbor region search along with random search and can be used for both integrated and functional optimization [26]. Detailed explanations about the algorithm were provided in Ref.s [27][28][29].…”
Section: Calculating Weights With Multi Objective Bees Algorithm (Moba)mentioning
confidence: 99%
“…Basically, it does some kind of neighbor region search along with random search and can be used for both integrated and functional optimization. Detailed explanations about the algorithm were provided in references [29,30]. The algorithm starts with the determination of some parameters, such as number of scout bees (n), number of the best site (m) for local search, number of the elite site (e) for local search, number of recruited bees in the elite site (nep), number of recruited bees in the best site (nsp), the size of the neighborhood for each patch (ngh), number of iterations (I).…”
Section: The Traveling Salesman Problem and The Bees Algorithmmentioning
confidence: 99%