AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2.3 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

Frilled Lizard Optimization: A Novel Bio-Inspired Optimizer for Solving Engineering Applications

Ibraheem Abu Falahah1Osama Al-Baik2Saleh Alomari3Gulnara Bektemyssova4Saikat Gochhait5,6Irina Leonova7Om Parkash Malik8Frank Werner9( )Mohammad Dehghani10
Department of Mathematics, Faculty of Science, The Hashemite University, P.O. Box 330127, Zarqa, 13133, Jordan
Department of Software Engineering, Al-Ahliyya Amman University, Amman, 19328, Jordan
Faculty of Science and Information Technology, Software Engineering, Jadara University, Irbid, 21110, Jordan
Department of Computer Engineering, International Information Technology University, Almaty, 050000, Kazakhstan
Symbiosis Institute of Digital and Telecom Management, Constituent of Symbiosis International Deemed University, Pune, 412115, India
Neuroscience Research Institute, Samara State Medical University, Samara, 443001, Russia
Faculty of Social Sciences, Lobachevsky University, Nizhny Novgorod, 603950, Russia
Department of Electrical and Software Engineering, University of Calgary, Calgary, AB T2N 1N4, Canada
Faculty of Mathematics, Otto-von-Guericke University, P.O. Box 4120, Magdeburg, 39016, Germany
Department of Electrical and Electronics Engineering, Shiraz University of Technology, Shiraz, 7155713876, Iran
Show Author Information

Abstract

This research presents a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the unique hunting behavior of frilled lizards in their natural habitat. FLO draws its inspiration from the sit-and-wait hunting strategy of these lizards. The algorithm’s core principles are meticulously detailed and mathematically structured into two distinct phases: (i) an exploration phase, which mimics the lizard’s sudden attack on its prey, and (ii) an exploitation phase, which simulates the lizard’s retreat to the treetops after feeding. To assess FLO’s efficacy in addressing optimization problems, its performance is rigorously tested on fifty-two standard benchmark functions. These functions include unimodal, high-dimensional multimodal, and fixed-dimensional multimodal functions, as well as the challenging CEC 2017 test suite. FLO’s performance is benchmarked against twelve established metaheuristic algorithms, providing a comprehensive comparative analysis. The simulation results demonstrate that FLO excels in both exploration and exploitation, effectively balancing these two critical aspects throughout the search process. This balanced approach enables FLO to outperform several competing algorithms in numerous test cases. Additionally, FLO is applied to twenty-two constrained optimization problems from the CEC 2011 test suite and four complex engineering design problems, further validating its robustness and versatility in solving real-world optimization challenges. Overall, the study highlights FLO’s superior performance and its potential as a powerful tool for tackling a wide range of optimization problems.

References

【1】
【1】
 
 
Computers, Materials & Continua
Pages 3631-3678

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Falahah IA, Al-Baik O, Alomari S, et al. Frilled Lizard Optimization: A Novel Bio-Inspired Optimizer for Solving Engineering Applications. Computers, Materials & Continua, 2024, 79(3): 3631-3678. https://doi.org/10.32604/cmc.2024.053189

147

Views

3

Downloads

44

Crossref

53

Web of Science

79

Scopus

Received: 20 April 2024
Accepted: 23 May 2024
Published: 30 June 2024
© The Author 2024.

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.