Integrating mutation operator into grasshopper optimization algorithm for global optimization
Autor: | Waheed Ali H. M. Ghanem, Mumtazimah Mohamad, Sanaa Abduljabbar Ahmed Ghaleb, Engku Fadzli Hasan Syed Abdullah |
---|---|
Rok vydání: | 2021 |
Předmět: |
0209 industrial biotechnology
Mathematical optimization Series (mathematics) Computer science Computational intelligence 02 engineering and technology Theoretical Computer Science Maxima and minima 020901 industrial engineering & automation Local optimum Operator (computer programming) Convergence (routing) 0202 electrical engineering electronic engineering information engineering Benchmark (computing) ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS 020201 artificial intelligence & image processing Geometry and Topology Global optimization Software |
Zdroj: | Soft Computing. 25:8281-8324 |
ISSN: | 1433-7479 1432-7643 |
DOI: | 10.1007/s00500-021-05752-y |
Popis: | The major purpose of this article is to enhance the performance of GOA algorithm by integrating a new mutation operator to the standard GOA algorithm. A series of six different variants of enhanced GOA is proposed by integrating GOA with six different variants of the mutation operator. The new enhanced metaheuristic optimization method is called EGOAs. EGOA aims to address the problems of slow convergence and trapping into local optima, by achieving a good balance between exploration and exploitation, using a special mutation operator that enhances the diversity of the standard GOA, to find the best solution for global optimization problems. The implementation process for enhancing the GOA algorithm is presented and the effectiveness of the enhanced algorithm is evaluated against 60 of the optimization benchmark functions, and compared to that of the standard GOA, as well as to other metaheuristic optimization algorithms. The performance of EGOAs was compared with the other improved methods based on GOA. Experimental results show that EGOAs is clearly superior to the standard GOA algorithm, as well as to other well-known algorithms, in terms of achieving the best optimal value, convergence speed, and avoiding local minima, which makes EGOAs a promising addition to the arsenal of metaheuristic algorithms. |
Databáze: | OpenAIRE |
Externí odkaz: |