Research Area: Metaheuristic Computing
The reptile search algorithm (RSA) is a swarm-based metaheuristic algorithm inspired by the encirclement and hunt mechanisms of crocodiles. Compared with other algorithms, RSA is competitive but still suffers from low population diversity, unbalanced exploitation and exploration, and the tendency to fall into local optima. To overcome these shortcomings, a modified variant of RSA, named MRSA, is proposed in this paper. First, an adaptive chaotic reverse learning strategy is employed to enhance the population diversity. Second, an elite alternative pooling strategy is proposed to balance exploitation and exploration. Finally, a shifted distribution estimation strategy is used to correct the evolutionary direction and improve the algorithm performance. Subsequently, the superiority of MRSA is verified using 23 benchmark functions, IEEE CEC2017 benchmark functions, and robot path planning problems. The Friedman test, the Wilcoxon signed-rank test, and simulation results show that the proposed MRSA outperforms other comparative algorithms in terms of convergence accuracy, convergence speed, and stability.
Keywords:
Reptile Search Algorithm
Numerical Optimization Problems
Author(s) Name: Qihang Yuan,Yongde Zhang,Xuesong Dai,and Shu Zhang
Journal name: Computational Intelligence and Neuroscience
Conferrence name:
Publisher name: Hindawi
DOI: 10.1155/2022/9752003
Volume Information:
