A Hybrid Owl Search Algorithm with Lévy Flights, Opposition-Based Learning, and Adaptive Memory for Continuous Optimization
Dasinya Journal for Engineering and Informatics · 26.07.2026 · 2 (3)
DOI: 10.65542/djei.v2i3.52 ↗Kurz gefasst
Fachartikel in der Zeitschrift Dasinya Journal for Engineering and Informatics, online erschienen am 26.07.2026. Verfasst von Awaz Ahmed Shaban und 1 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This study develops and evaluates a selective adaptive hybrid variant of the Owl Search Algorithm (OSA) for bounded continuous optimization. The proposed framework integrates Lévy-flight perturbation, opposition-based learning (OBL), and adaptive memory guidance within an operator-coordination mechanism designed to regulate the balance between diversification and intensification. Its contribution is not merely the aggregation of established enhancement operators; rather, it lies in examining whether adaptive operator scheduling can produce more stable performance than deterministic serial hybridization when the same operator set is used. Six OSA-derived variants are evaluated under a unified benchmark protocol: the canonical OSA, OSA with Lévy flights, OSA with OBL, OSA with memory guidance, a selection-based hybrid, and a serial hybrid. Experiments on 23 standard continuous benchmark functions indicate that the selection-based hybrid achieves the strongest aggregate profile, with an average rank of 2.326 and 12 best/tied-best function outcomes, followed by the serial hybrid with an average rank of 2.609 and seven best/tied-best outcomes. The results suggest that state-responsive coordination can improve robustness across heterogeneous landscapes by allocating search effort according to diversity, stagnation, and recent improvement history. The study also identifies the current validation boundary of the work and outlines the additional external benchmarking and application-oriented experiments required for broader claims of general competitiveness.
Zitieren
APA
Shaban, A. A., & Zeebaree, S. R. M. (2026). A Hybrid Owl Search Algorithm with Lévy Flights, Opposition-Based Learning, and Adaptive Memory for Continuous Optimization. Dasinya Journal for Engineering and Informatics, 2(3). https://doi.org/10.65542/djei.v2i3.52
Vancouver
Shaban AA, Zeebaree SRM. A Hybrid Owl Search Algorithm with Lévy Flights, Opposition-Based Learning, and Adaptive Memory for Continuous Optimization. Dasinya Journal for Engineering and Informatics. 2026;2(3). doi:10.65542/djei.v2i3.52
BibTeX
@article{Shaban2026,
author = {Shaban, Awaz Ahmed and Zeebaree, Subhi R. M.},
title = {A Hybrid Owl Search Algorithm with Lévy Flights, Opposition-Based Learning, and Adaptive Memory for Continuous Optimization},
journal = {Dasinya Journal for Engineering and Informatics},
year = {2026},
volume = {2},
number = {3},
doi = {10.65542/djei.v2i3.52}
}
EUVIMED