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

• Published in: Mathematics
• Main Authors: Yan Liang, Xianzhi Hu, Gang Hu, Wanting Dou
• Format: Article in Journal/Newspaper
• Language: English
• Published: MDPI AG 2022
• Subjects: northern goshawk optimization algorithm; polynomial interpolation; opposite learning method; engineering optimization problem; traveling salesman problem; Mathematics; QA1-939; Northern Goshawk
• Online Access: https://doi.org/10.3390/math10224383; https://doaj.org/article/8108e0c3219b44d89e65bb7e93bda03d

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.