Skip to content
naulon
Not checkedNot checked for notices yet.

Hare escape optimization algorithm with applications in engineering and deep learning

Doaa Alsamee, Reza Ramezani

Scientific Reports · 2025

doi:10.1038/s41598-025-10289-3 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Abstract The Hare Escape Optimization (HEO) algorithm is a novel metaheuristic inspired by the evasive movement strategies of hares when pursued by predators. Unlike conventional nature-inspired algorithms, HEO integrates Levy flight dynamics and adaptive directional shifts to enhance the balance between exploration and exploitation, improving its ability to escape local optima and converge efficiently. To validate its effectiveness, HEO was tested against 29 state-of-the-art metaheuristics on 43 benchmark functions from the CEC 2015 and CEC 2020 testbeds, demonstrating superior performance in both unimodal and multimodal landscapes. Beyond benchmark validation, HEO was applied to four complex constrained engineering design problems; spring, welded beam, pressure vessel, and truss optimization where it outperformed leading optimization methods in solution feasibility and computational efficiency. Additionally, HEO was employed to optimize hyperparameters in convolutional neural networks (CNNs) for image classification tasks, significantly enhancing model accuracy and convergence speed. The results indicate that HEO is a robust, adaptable optimization tool with promising applications in both engineering and deep learning. Its unique search mechanism provides a new perspective in metaheuristic optimization, opening pathways for further advancements in intelligent optimization techniques.

Abstract licence: CC BY-NC-ND

References85

    40 more references, whose wording the paper’s licence keeps private.

    All 85 references

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.