2012
DOI: 10.1007/978-3-642-30976-2_39
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Artificial Bee Colony Algorithm Based on Gaussian Mutation and Chaos Disturbance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…The Gaussian mutation operation has been derived from the Gaussian normal distribution and has demonstrated its effectiveness with application to evolutionary search [ 68 ]. This theory was referred to as classical evolutionary programming (CEP).The Gaussian mutations have been used to exploit the searching capabilities of ABC [ 69 ], PSO [ 70 ], and DE [ 71 ]. Also, Gaussian mutation is more likely to create a new offspring near the original parent because of its narrow tail.…”
Section: Background Informationmentioning
confidence: 99%
“…The Gaussian mutation operation has been derived from the Gaussian normal distribution and has demonstrated its effectiveness with application to evolutionary search [ 68 ]. This theory was referred to as classical evolutionary programming (CEP).The Gaussian mutations have been used to exploit the searching capabilities of ABC [ 69 ], PSO [ 70 ], and DE [ 71 ]. Also, Gaussian mutation is more likely to create a new offspring near the original parent because of its narrow tail.…”
Section: Background Informationmentioning
confidence: 99%
“…In this paper, artificial bee colony algorithm is selected because its fast convergence, more accurate solution and stability [23][24].…”
Section: Parameter Optimization Of Modelsmentioning
confidence: 99%
“…GA approach is especially suitable for solving the complex and nonlinear problems which are hard for traditional search methods. It is good at global search and has stronger robustness than conventional search algorithms [9]. However, when GA approach searches nearby the global optimal solution, its search ability intends to decrease, even may get stuck in local minimum [2].…”
Section: Outline Of the Algorithmmentioning
confidence: 99%