.png){kind=icon}
.png){kind=icon}
Return
An improved grasshopper optimization algorithm based on dynamic dual elite learning and sinusoidal mutation
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-021-00991-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Grasshopper optimization algorithm (GOA) is a meta-heuristic algorithm for solving optimization problems by modeling the biological habit and social behavior of grasshopper swarms in nature. Compared with other optimization algorithms, GOA still has room to improve its performance on solving complex problems. Therefore, this paper proposes an improved grasshopper optimization algorithm (EMGOA) based on dynamic dual elite learning and sinusoidal mutation. First of all, dynamic elite learning strategy is adopted to improve the influence of elites on the update process, enabling the algorithm to have a faster convergence speed. Then, sinusoidal function is utilized to guide the mutation of the current global optimal individual during each iteration to avoid the algorithm falling into the local optimum and improve the convergence accuracy of the algorithm. In order to investigate the performance of the proposed EMGOA algorithm, experiments are conducted on 26 benchmark functions and CEC2019 in this paper. The experimental results show that the optimization performance of EMGOA is obviously better than GOA, and EMGOA is competitive with six state-of-the-art meta-heuristic optimization algorithms.
Keywords:
Grasshopper optimization algorithm
Dynamic elite learning
Sinusoidal mutation
Optimization algorithm
Meta-heuristic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.