An Enhanced Northern Goshawk Optimization Algorithm and Its Application in Practical Optimization Problems

Yan Liang, Xianzhi Hu, Gang Hu () and Wanting Dou
Additional contact information
Yan Liang: School of Technology, Xi’an Siyuan University, Xi’an 710038, China
Xianzhi Hu: Division of Informationize Management, Xi’an University of Technology, Xi’an 710048, China
Gang Hu: Department of Applied Mathematics, Xi’an University of Technology, Xi’an 710054, China
Wanting Dou: School of Technology, Xi’an Siyuan University, Xi’an 710038, China

Mathematics, 2022, vol. 10, issue 22, 1-33

Abstract: As a kind of effective tool in solving complex optimization problems, intelligent optimization algorithms are paid more attention to their advantages of being easy to implement and their wide applicability. This paper proposes an enhanced northern goshawk optimization algorithm to further improve the ability to solve challenging tasks. Firstly, by applying the polynomial interpolation strategy to the whole population, the quality of the solutions can be enhanced to keep a fast convergence to the better individual. Then, to avoid falling into lots of local optimums, especially late in the whole search, different kinds of opposite learning methods are used to help the algorithm to search the space more fully, including opposite learning, quasi-opposite learning, and quasi-reflected learning, to keep the diversity of the population, which is noted as a multi-strategy opposite learning method in this paper. Following the construction of the enhanced algorithm, its performance is analyzed by solving the CEC2017 test suite, and five practical optimization problems. Results show that the enhanced algorithm ranks first on 23 test functions, accounting for 79.31% among 29 functions, and keeps a faster convergence speed and a better stability on most functions, compared with the original northern goshawk optimization algorithm and other popular algorithms. For practical problems, the enhanced algorithm is still effective. When the complexity of the TSP is increased, the performance of the improved algorithm is much better than others on all measure indexes. Thus, the enhanced algorithm can keep the balance between exploitation and exploration and obtain better solutions with a faster speed for problems of high complexity.

Keywords: northern goshawk optimization algorithm; polynomial interpolation; opposite learning method; engineering optimization problem; traveling salesman problem (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/22/4383/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/22/4383/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:22:p:4383-:d:979111

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().