A Modified Emperor Penguin Algorithm for Solving Stagnation in Multi-Model Functions

Abstract

Metaheuristic algorithms have gained attention in recent years for their ability to solve complex problems that cannot be solved using classical mathematical techniques. This paper proposes an improvement to the Emperor Penguin Optimizer algorithm, a population-based metaheuristic. The original algorithm often gets stuck in local optima for multi-modal functions. To address this issue, this paper presents a modification in the relocating procedures that allows the algorithm to utilize information gained from the previous positions of each penguin. To demonstrate the effectiveness of the modified algorithm, 20 test optimization functions from well-known benchmarks were selected. The results show that the proposed algorithm is highly efficient, especially in multi-modal functions.

Authors

  • Ahmed El Sayed Serag PHD Candidate, Faculty of graduate studies for statistical research, Cairo University
  • Hegazy Zaher , faculty of graduate studies for statistical research, Cairo University, Giza, Egypt
  • Naglaa Ragaa faculty of graduate studies for statistical research, Cairo University, Giza, Egypt
  • Heba Sayed faculty of graduate studies for statistical research, Cairo University, Giza, Egypt

DOI:

https://doi.org/10.31449/inf.v47i10.5273

Downloads

Additional Files

Published

01/11/2024

How to Cite

Serag, A. E. S., Zaher, H., Ragaa, N., & Sayed, H. (2024). A Modified Emperor Penguin Algorithm for Solving Stagnation in Multi-Model Functions. Informatica, 47(10). https://doi.org/10.31449/inf.v47i10.5273

Issue

Vol. 47 No. 10 (2023): Online-only issue

Section

Online-only

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.