EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Hunger games search algorithm based on stochastic individual information for engineering design optimization problems

Zhen Wang, Dong Zhao, Ali Asghar Heidari, Huiling Chen

Journal of Computational Design and Engineering · 01.05.2024 · 11 (3) · 280-307

DOI: 10.1093/jcde/qwae050 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computational Design and Engineering, online erschienen am 25.05.2024. Verfasst von Zhen Wang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 141 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: Natural Science Foundation of Jilin Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The hunger games search algorithm (HGS) is a newly proposed metaheuristic algorithm that emulates hunger-driven foraging behaviors in a population. It combines fitness values to determine individual weights and updates them based on fitness value size, resulting in high adaptability and effective optimization. However, HGS faces issues like low convergence accuracy and susceptibility to local optima in complex optimization problems. To address these problems, an improved version called BDFXHGS is introduced. BDFXHGS incorporates a collaborative feeding strategy based on HGS’s design advantages. Individuals approach others based on hunger degree, facilitating information exchange and resolving convergence and accuracy issues. BDFXHGS combines a disperse foraging strategy and a directional crossover strategy to enhance exploration and convergence speed. The paper conducts qualitative analysis and ablation experiments to examine the effectiveness of the strategies. Comparative experiments are performed using IEEE CEC 2017 benchmark functions to compare BDFXHGS with competitive algorithms, including previous champion algorithms in different dimensions. Additionally, BDFXHGS is evaluated on 25 constrained optimization problems from the IEEE CEC 2020 competition and five real engineering optimization problems. Experimental results show that BDFXHGS performs well on benchmarks and outperforms other algorithms in real-world applications.

Förderung

  • Natural Science Foundation of Jilin Province

Zitieren

APA

Wang, Z., Zhao, D., Heidari, A. A., & Chen, H. (2024). Hunger games search algorithm based on stochastic individual information for engineering design optimization problems. Journal of Computational Design and Engineering, 11(3), 280-307. https://doi.org/10.1093/jcde/qwae050

Vancouver

Wang Z, Zhao D, Heidari AA, Chen H. Hunger games search algorithm based on stochastic individual information for engineering design optimization problems. Journal of Computational Design and Engineering. 2024;11(3):280-307. doi:10.1093/jcde/qwae050

BibTeX
@article{Wang2024,
  author = {Wang, Zhen and Zhao, Dong and Heidari, Ali Asghar and Chen, Huiling},
  title = {Hunger games search algorithm based on stochastic individual information for engineering design optimization problems},
  journal = {Journal of Computational Design and Engineering},
  year = {2024},
  volume = {11},
  number = {3},
  pages = {280--307},
  doi = {10.1093/jcde/qwae050}
}
Kostenlos starten →