返回
An efficient and robust artificial bee colony algorithm for numerical optimization
DOI:10.1016/j.cor.2012.12.006.png)
摘要
En 中文
Artificial bee colony (ABC) algorithm has already shown more effective than other population-based algorithms. However, ABC is good at exploration but poor at exploitation, which results in an issue on convergence performance in some cases. To improve the convergence performance of ABC, an efficient and robust artificial bee colony (ERABC) algorithm is proposed. In ERABC, a combinatorial solution search equation is introduced to accelerate the search process. And in order to avoid being trapped in local minima, chaotic search technique is employed on scout bee phase. Meanwhile, to reach a kind of sustainable evolutionary ability, reverse selection based on roulette wheel is applied to keep the population diversity. In addition, to enhance the global convergence, chaotic initialization is used to produce initial population. Finally, experimental results tested on 23 benchmark functions show that ERABC has a very good performance when compared with two ABC-based algorithms. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Artificial bee colony algorithm
Initialization based on chaos
Reverse selection based on roulette wheel
Solution search equation
Chaotic search
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Endogenous estrogen is not associated with cognitive performance before, during, or after menopause
Menopause
IF0
Non‐word repetition and literacy in Dutch children at‐risk of dyslexia and children with SLI: results of the follow‐up study
Dyslexia
IF0

