Gannet optimization algorithm : A new metaheuristic algorithm for solving engineering optimization problems

Abstract

Engineering design problems are usually large-scale constrained optimization problems, and metaheuristic algorithms are vital for solving such complex problems. Therefore, this paper introduces a new nature-inspired metaheuristic algorithm: the gannet optimization algorithm (GOA). The GOA mathematizes the various unique behaviors of gannets during foraging and is used to enable exploration and exploitation. GOA’s U-shaped and V-shaped diving patterns are responsible for exploring the optimal region within the search space, with sudden turns and random walks ensuring better solutions are found in this region. In order to verify the ability of the GOA to find the optimal solution, we compared it with other comparison algorithms in multiple dimensions of 28 benchmark functions. We found that the GOA has a shorter running time in high dimensions and can provide a better solution. Finally, we apply the GOA to five engineering optimization problems. The experimental results show that the GOA is suitable for many constrained engineering design problems and can provide better solutions in most cases.