返回
Multi-strategy adaptive cuckoo search algorithm for numerical optimization
DOI:10.1007/s10462-022-10222-4.png)
摘要
En 中文
Cuckoo search (CS) algorithm is a popular and efficient search technique for tackling numerical optimization problems. Nevertheless, CS algorithm is prone to premature convergence in solving complex multimode problems. Motivated by this observation, we propose a novel CS algorithm named multi-strategy adaptive CS (MACS). Specifically, in MACS, a parameter control strategy based on the Cauchy distribution and Lehmer mean is employed to dynamically update the step size. After that, three search strategies with different advantages are integrated to complement one another throughout the evolution process, which further strengthens the versatility and robustness. Besides, after every certain number of generations, a probability matching scheme is adopted to adaptively determine the best performing search strategy to produce more promising offspring. Extensive experiments are conducted on 42 benchmark problems from two different test suites. In comparison to seven advanced CS variants as well as other several popular algorithms, the experimental results indicate that MACS exhibits better overall performance.
Keyword:
Cuckoo search
Multi-strategy
Adaptive
Numerical optimization
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
Comprehensive learning cuckoo search with chaos-lambda method for solving economic dispatch problems
APPLIED INTELLIGENCE
IF3.5
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization求解全局数值优化问题的策略自适应差分进化算法
Multi-strategy ensemble grey wolf optimizer and its application to feature selection多策略集成灰狼优化器及其在特征选择中的应用

