返回
A grey artificial bee colony algorithm
DOI:10.1016/j.asoc.2017.06.015.png)
摘要
En 中文
Artificial bee colony (ABC) algorithm is a very popular population-based algorithm. Unfortunately, there exists a shortcoming of slow convergence rate, which partly results from random choices of neighbor individuals regarding its solution search equation. A novel scheme for the choice of neighbors is introduced based on grey relational degrees between a current individual and its neighbors to overcome the insufficiency. Then, the chosen neighbor is used to guide the search process. Additionally, inspired by differential evolution, a solution search equation called ABC/rand/2 is employed to balance the previous exploitation and a new perturbation scheme is also employed. What is more, solution search equations using information of the best individual, an opposition-based learning method and a chaotic initialization technique are also integrated into the proposed algorithm called grey artificial bee colony algorithm (GABC for short). Subsequently, the effectiveness and efficiency of GABC are validated on a test suite composed of fifty-seven benchmark functions. Furthermore, it is also compared with a few state-of-the-artalgorithms. The related experimental results show the effectiveness and superiority of GABC. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Artificial bee colony algorithm
Grey relational analysis
Opposition based learning
Chaotic initialization
Numerical optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization求解全局数值优化问题的策略自适应差分进化算法

