2009
DOI: 10.1007/978-3-642-03156-4_27
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Quantum Evolutionary Algorithm Based on Artificial Bee Colony Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…Duan et al [37] proposed a hybrid method combining Quantum Evolutionary Algorithm (QEA) and ABC to overcome the limitations of stagnation. In their method, ABC is responsible for enhancing the local search capability as well as randomness of populations, which in turn will help QEA to avoid the local optimum.…”
Section: C) Hybrid Abc Variantsmentioning
confidence: 99%
“…Duan et al [37] proposed a hybrid method combining Quantum Evolutionary Algorithm (QEA) and ABC to overcome the limitations of stagnation. In their method, ABC is responsible for enhancing the local search capability as well as randomness of populations, which in turn will help QEA to avoid the local optimum.…”
Section: C) Hybrid Abc Variantsmentioning
confidence: 99%
“…[20] combined ABC with GA, and used crossover and exchange mechanism in GA to improve the update formula of bee, so that it can jump out of local optimal solution. The concept of QE-ABC is proposed to improve the randomness of initial population and individual local exploration ability in [21].…”
Section: Introductionmentioning
confidence: 99%
“…Despite these improved algorithms [18][19][20][21] have been proved to be effective in solving optimization problems, there are still the following shortcomings: The improved method is limited to partial optimization of the algorithm, and does not consider the characteristics of the bee popuplation as a whole. Although it produces better optimization results in individual stages, when the dimension of the optimization problem increases, the performance of the ABC algorithm will be reduced like other swarm intelligence algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…However, it is easy to fall into a local optimal solution during the ABC algorithm iteration. To this end, many improved ABC algorithms have been proposed, such as Rosenbrocks rotational direction strategy [ 28 ], Boltzmann selection strategy [ 29 ], DE-ABC (differential evolution-ABC) [ 30 ], PSO-ABC (particle swarm optimization-ABC) [ 31 ], and QE-ABC (quantum evolutionary-ABC) [ 32 ]. Although those modified ABC algorithms have been widely used in various path planning problems, they were limited by the inherent limitations of the heuristics.…”
Section: Introductionmentioning
confidence: 99%