Novel Greylag Goose Optimization Algorithm with Evolutionary Game Theory (EGGO)

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper, an Enhanced Greylag Goose Optimization Algorithm (EGGO) based on evolutionary game theory is presented to address the limitations of the traditional Greylag Goose Optimization Algorithm (GGO) in global search ability and convergence speed. By incorporating dynamic strategy adjustment from evolutionary game theory, EGGO improves global search efficiency and convergence speed. Furthermore, EGGO employs dynamic grouping, random mutation, and local search enhancement to boost efficiency and robustness. Experimental comparisons on standard test functions and the CEC 2022 benchmark suite show that EGGO outperforms other classic algorithms and variants in convergence precision and speed. Its effectiveness in practical optimization problems is also demonstrated through applications in engineering design, such as the design of tension/compression springs, gear trains, and three-bar trusses. EGGO offers a novel solution for optimization problems and provides a new theoretical foundation and research framework for swarm intelligence algorithms.

Cite

CITATION STYLE

APA

Wang, L., Yao, Y., Yang, Y., Zang, Z., Zhang, X., Zhang, Y., & Yu, Z. (2025). Novel Greylag Goose Optimization Algorithm with Evolutionary Game Theory (EGGO). Biomimetics, 10(8). https://doi.org/10.3390/biomimetics10080545

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free