.png){kind=icon}
Return
Multi-strategy adaptive cuckoo search algorithm for numerical optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10462-022-10222-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Cuckoo search
Multi-strategy
Adaptive
Numerical optimization
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
ShareSaveComprehensive learning cuckoo search with chaos-lambda method for solving economic dispatch problems.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveA novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber-physical systems
PREAI
ShareSave
ShareSaveComprehensive learning particle swarm optimizer for global optimization of multimodal functions
PREAI
ShareSaveShareSave
View more