Abstract
Nature-inspired metaheuristic approaches draw their core idea from biological evolution in order to create new and powerful competing algorithms. Such algorithms can be divided into evolution-based and swarm-based algorithms. This paper proposed a new nature-inspired optimizer called the Greylag Goose Optimization (GGO) algorithm. The proposed algorithm (GGO) belongs to the class of swarm-based algorithms and is inspired by the Greylag Goose. Geese are excellent flyers and during their seasonal migrations, they fly in a group and can cover thousands of kilometers in a single flight. While flying, a group of geese forms themselves as a “V” configuration. In this way, the geese in the front can minimize the air resistance of the ones in the back. This allows the geese to fly around 70% farther as a group than they could individually. The GGO algorithm is first validated by being applied to nineteen datasets retrieved from the UCI Machine Learning Repository. Each dataset contains a varied amount of characteristics, instances, and classes that are used to choose features. After that, it is put to use in the process of solving a number of engineering benchmark functions and case studies. Several case studies are solved using the proposed algorithm too, including the pressure vessel design and the tension/compression spring design. The findings demonstrate that the GGO method outperforms numerous other comparative optimization algorithms and delivers superior accuracy compared to other algorithms. The results of the statistical analysis tests, such as Wilcoxon’s rank-sum and one-way analysis of variance (ANOVA), demonstrate that the GGO algorithm achieves superior results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.