返回
Multi-Strategy Adaptive Cuckoo Search Algorithm
DOI:10.1109/ACCESS.2019.2916568.png)
摘要
En 中文
Cuckoo search algorithm (CS) is a powerful biological-inspired search algorithm, which is widely used in continuous space optimization problems. However, a single search strategy in CS makes all cuckoos have similar search behavior, and it is liable to plunges into local optimal. In addition, whether CS can successfully solve a problem largely depends on the value of control parameters. Using the trial and error method to determine the value of parameters will cost a lot of computational expense frequently. In order to solve these problems, a multi-strategy adaptive cuckoo algorithm (MSACS) is proposed in this paper. Firstly, five search strategies are adapted to cooperate with each other, and the use of various previous strategies and control parameters are studied. The probability of each strategy being used and the value of control parameters are changed adaptively. Then, the performance of MSACS is tested and evaluated on 24 common benchmark functions. Finally, several advanced CS algorithms, particle swarm algorithm (PSO) and differential evolution algorithm (DE) variants will be compared with MSACS. The results show that the MSACS is better than the algorithms above.
Keyword:
Cuckoo search algorithm
multi-strategy
self-adaptive
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization求解全局数值优化问题的策略自适应差分进化算法
A particle swarm inspired cuckoo search algorithm for real parameter optimization基于粒子群的布谷鸟搜索算法的实参数优化
SOFT COMPUTING
IF2.5

