Open Access iconOpen Access

ARTICLE

crossmark

Wild Gibbon Optimization Algorithm

Jia Guo1,2,4,6, Jin Wang2, Ke Yan3, Qiankun Zuo1,2,4,*, Ruiheng Li1,2,4, Zhou He1,2,4, Dong Wang5, Yuji Sato6

1 Hubei Key Laboratory of Digital Finance Innovation, Hubei University of Economics, Wuhan, 430205, China
2 School of Information Engineering, Hubei University of Economics, Wuhan, 430205, China
3 China Construction Third Engineering Bureau Installation Engineering Co., Ltd., Wuhan, 430074, China
4 Hubei Internet Finance Information Engineering Technology Research Center, Hubei University of Economics, Wuhan, 430205, China
5 College of Informatics, Huazhong Agricultural University, Wuhan, 430070, China
6 Faculty of Computer and Information Sciences, Hosei University, Tokyo, 184-8584, Japan

* Corresponding Author: Qiankun Zuo. Email: email

(This article belongs to the Special Issue: Metaheuristic-Driven Optimization Algorithms: Methods and Applications)

Computers, Materials & Continua 2024, 80(1), 1203-1233. https://doi.org/10.32604/cmc.2024.051336

Abstract

Complex optimization problems hold broad significance across numerous fields and applications. However, as the dimensionality of such problems increases, issues like the curse of dimensionality and local optima trapping also arise. To address these challenges, this paper proposes a novel Wild Gibbon Optimization Algorithm (WGOA) based on an analysis of wild gibbon population behavior. WGOA comprises two strategies: community search and community competition. The community search strategy facilitates information exchange between two gibbon families, generating multiple candidate solutions to enhance algorithm diversity. Meanwhile, the community competition strategy reselects leaders for the population after each iteration, thus enhancing algorithm precision. To assess the algorithm’s performance, CEC2017 and CEC2022 are chosen as test functions. In the CEC2017 test suite, WGOA secures first place in 10 functions. In the CEC2022 benchmark functions, WGOA obtained the first rank in 5 functions. The ultimate experimental findings demonstrate that the Wild Gibbon Optimization Algorithm outperforms others in tested functions. This underscores the strong robustness and stability of the gibbon algorithm in tackling complex single-objective optimization problems.

Keywords


Cite This Article

APA Style
Guo, J., Wang, J., Yan, K., Zuo, Q., Li, R. et al. (2024). Wild gibbon optimization algorithm. Computers, Materials & Continua, 80(1), 1203-1233. https://doi.org/10.32604/cmc.2024.051336
Vancouver Style
Guo J, Wang J, Yan K, Zuo Q, Li R, He Z, et al. Wild gibbon optimization algorithm. Comput Mater Contin. 2024;80(1):1203-1233 https://doi.org/10.32604/cmc.2024.051336
IEEE Style
J. Guo et al., “Wild Gibbon Optimization Algorithm,” Comput. Mater. Contin., vol. 80, no. 1, pp. 1203-1233, 2024. https://doi.org/10.32604/cmc.2024.051336



cc Copyright © 2024 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 521

    View

  • 265

    Download

  • 0

    Like

Share Link