Anas Bouaouda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Anas Bouaouda has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Abdelazim G. Hussien
Linköping University
4 shared publications Fatma A. Hashim
Biomedical Engineering Department, Faculty of Engineering, Capital University (Formerly Helwan University), Cairo, Egypt
3 shared publications- Fatma A. Hashim
Faculty of Engineering, Helwan University, Cairo 11795, Egypt
3 shared publications - Gang Hu
Department of Applied Mathematics, Xi’an University of Technology, Xi’an, China
3 shared publications Mohammed A. El-Shorbagy
Department of Mathematics, College of Science and Humanities in Al-Kharj, Prince Sattam bin Abdulaziz University, Al-Kharj, Saudi Arabia
3 shared publicationsLaith Abualigah
School of Engineering and Technology, Sunway University Malaysia, Petaling Jaya, Malaysia
2 shared publications
Latest Publications
- Open Access
- 7 March 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (4) , 230
Enhanced FOPID controller for AGC of two-area power system using a Modified Chernobyl Disaster Optimizer
Ensuring frequency stability in interconnected power systems is challenging due to continuous load variations and fluctuations in tie-line power. This study focuses on designing and optimizing controllers for Automatic Generation Control (AGC) of a two-area power system to achieve zero-frequency deviation under dynamic load conditions. Five different controllers—PID (Proportional-Integral-Derivative), PIDn, FOPID (Fractional Order PID), TID (Tilt-Integral-Derivative), and PIDA—were tested. Their parameters were optimized using seven advanced metaheuristic algorithms: Artificial Rabbit Optimization, Chernobyl Disaster Optimizer (CDO), Modified Chernobyl Disaster Optimizer (mCDO), Golden Jackal Optimization, Honey Badger Algorithm, Mont-Flame Optimization, and Spider Wasp Optimizer. A total of 35 simulation studies were conducted, and performance was evaluated using the Integral of Time-Weighted Absolute Error (ITAE) metric Among the tested controllers, the FOPID-mCDO combination achieved the lowest ITAE value (0.320684), a settling time of 3.6 s, and minimal overshoot (0.0083 Hz) and undershoot (− 0.1480 Hz). Compared to conventional PID controllers, this configuration reduced settling time by 10% and improved frequency stability under dynamic load variations. The proposed mCDO algorithm, which integrates neighborhood–global and wandering search strategies to enhance the exploration–exploitation balance of the original CDO, outperformed the standard CDO by enabling faster convergence and more precise parameter tuning. The findings indicate that the FOPID-mCDO combination is a promising approach for automatic generation control in multi-area power systems.
- 7 March 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (4) , 230
Open AccessEnhanced FOPID controller for AGC of two-area power system using a Modified Chernobyl Disaster Optimizer
Ensuring frequency stability in interconnected power systems is challenging due to continuous load variations and fluctuations in tie-line power. This study focuses on designing and optimizing controllers for Automatic Generation Control (AGC) of a two-area power system to achieve zero-frequency deviation under dynamic load conditions. Five different controllers—PID (Proportional-Integral-Derivative), PIDn, FOPID (Fractional Order PID), TID (Tilt-Integral-Derivative), and PIDA—were tested. Their parameters were optimized using seven advanced metaheuristic algorithms: Artificial Rabbit Optimization, Chernobyl Disaster Optimizer (CDO), Modified Chernobyl Disaster Optimizer (mCDO), Golden Jackal Optimization, Honey Badger Algorithm, Mont-Flame Optimization, and Spider Wasp Optimizer. A total of 35 simulation studies were conducted, and performance was evaluated using the Integral of Time-Weighted Absolute Error (ITAE) metric Among the tested controllers, the FOPID-mCDO combination achieved the lowest ITAE value (0.320684), a settling time of 3.6 s, and minimal overshoot (0.0083 Hz) and undershoot (− 0.1480 Hz). Compared to conventional PID controllers, this configuration reduced settling time by 10% and improved frequency stability under dynamic load variations. The proposed mCDO algorithm, which integrates neighborhood–global and wandering search strategies to enhance the exploration–exploitation balance of the original CDO, outperformed the standard CDO by enabling faster convergence and more precise parameter tuning. The findings indicate that the FOPID-mCDO combination is a promising approach for automatic generation control in multi-area power systems.
- Open Access
- 1 January 2026
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 147 (2) , 1-10
A Comprehensive Review of Barnacles Mating Optimizer: Theoretical Foundation, Variants, Applications, and Future Research Directions
As real-world optimization problems become more complex, the development of sophisticated and robust algorithms has become essential. Consequently, researchers are focusing on advanced optimization methods that efficiently explore the feasible solution space. This involves designing new high-performance algorithms or enhancing existing meta-heuristic methods by integrating advanced evolutionary strategies. Barnacles Mating Optimizer (BMO) is an evolutionary-based meta-heuristic algorithm inspired by the mating behavior of barnacles, incorporating Hardy–Weinberg principles and the sperm-cast mechanism. Introduced in 2020, BMO has attracted significant attention and has been successfully applied across diverse fields due to its simple design, ease of implementation, high flexibility, and efficient convergence. Therefore, this review provides an overview and synthesis of studies employing BMO. It begins with an introduction to BMO, describing its natural inspiration and optimization framework, followed by a discussion of its core operational procedures and theoretical foundations. The paper then presents a comprehensive analysis of recent BMO variants, systematically categorizing them into modified, multi-objective, and hybrid versions. It also examines BMO’s diverse real-world applications, including power and control engineering, classification, image processing, wireless networks, forecasting, and signal processing. In addition, an updated performance evaluation of BMO is provided, comparing its effectiveness against recently published algorithms using the CEC2005 benchmark suite. Key strengths of BMO are highlighted, including its ability to balance exploration and exploitation, adaptability across problem domains, and its potential for hybridization with other optimization algorithms. Finally, potential enhancements and future research directions are outlined, including multi-objective variants, integration with deep learning, and parallel or distributed implementations.
- 1 January 2026
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 147 (2) , 1-10
Open AccessA Comprehensive Review of Barnacles Mating Optimizer: Theoretical Foundation, Variants, Applications, and Future Research Directions
As real-world optimization problems become more complex, the development of sophisticated and robust algorithms has become essential. Consequently, researchers are focusing on advanced optimization methods that efficiently explore the feasible solution space. This involves designing new high-performance algorithms or enhancing existing meta-heuristic methods by integrating advanced evolutionary strategies. Barnacles Mating Optimizer (BMO) is an evolutionary-based meta-heuristic algorithm inspired by the mating behavior of barnacles, incorporating Hardy–Weinberg principles and the sperm-cast mechanism. Introduced in 2020, BMO has attracted significant attention and has been successfully applied across diverse fields due to its simple design, ease of implementation, high flexibility, and efficient convergence. Therefore, this review provides an overview and synthesis of studies employing BMO. It begins with an introduction to BMO, describing its natural inspiration and optimization framework, followed by a discussion of its core operational procedures and theoretical foundations. The paper then presents a comprehensive analysis of recent BMO variants, systematically categorizing them into modified, multi-objective, and hybrid versions. It also examines BMO’s diverse real-world applications, including power and control engineering, classification, image processing, wireless networks, forecasting, and signal processing. In addition, an updated performance evaluation of BMO is provided, comparing its effectiveness against recently published algorithms using the CEC2005 benchmark suite. Key strengths of BMO are highlighted, including its ability to balance exploration and exploitation, adaptability across problem domains, and its potential for hybridization with other optimization algorithms. Finally, potential enhancements and future research directions are outlined, including multi-objective variants, integration with deep learning, and parallel or distributed implementations.
- 12 March 2025
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 32 (5) , 2917-2986
A Comprehensive Review of the Tunicate Swarm Algorithm: Variations, Applications, and Results
- 12 March 2025
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 32 (5) , 2917-2986
A Comprehensive Review of the Tunicate Swarm Algorithm: Variations, Applications, and Results
- Open Access
- 28 February 2025
- Published by PeerJ in PeerJ Computer Science
- Vol. 11, e2722
Atom Search Optimization: a comprehensive review of its variants, applications, and future directions
The Atom Search Optimization (ASO) algorithm is a recent advancement in metaheuristic optimization inspired by principles of molecular dynamics. It mathematically models and simulates the natural behavior of atoms, with interactions governed by forces derived from the Lennard-Jones potential and constraint forces based on bond-length potentials. Since its inception in 2019, it has been successfully applied to various challenges across diverse fields in technology and science. Despite its notable achievements and the rapidly growing body of literature on ASO in the metaheuristic optimization domain, a comprehensive study evaluating the success of its various implementations is still lacking. To address this gap, this article provides a thorough review of half a decade of advancements in ASO research, synthesizing a wide range of studies to highlight key ASO variants, their foundational principles, and significant achievements. It examines diverse applications, including single- and multi-objective optimization problems, and introduces a well-structured taxonomy to guide future exploration in ASO-related research. The reviewed literature reveals that several variants of the ASO algorithm, including modifications, hybridizations, and multi-objective implementations, have been developed to tackle complex optimization problems. Moreover, ASO has been effectively applied across various domains, such as engineering, healthcare and medical applications, Internet of Things and communication, clustering and data mining, environmental modeling, and security, with engineering emerging as the most prevalent application area. By addressing the common challenges researchers face in selecting appropriate algorithms for real-world problems, this study provides valuable insights into the practical applications of ASO and offers guidance for designing ASO variants tailored to specific optimization problems.
- 28 February 2025
- Published by PeerJ in PeerJ Computer Science
- Vol. 11, e2722
Open AccessAtom Search Optimization: a comprehensive review of its variants, applications, and future directions
The Atom Search Optimization (ASO) algorithm is a recent advancement in metaheuristic optimization inspired by principles of molecular dynamics. It mathematically models and simulates the natural behavior of atoms, with interactions governed by forces derived from the Lennard-Jones potential and constraint forces based on bond-length potentials. Since its inception in 2019, it has been successfully applied to various challenges across diverse fields in technology and science. Despite its notable achievements and the rapidly growing body of literature on ASO in the metaheuristic optimization domain, a comprehensive study evaluating the success of its various implementations is still lacking. To address this gap, this article provides a thorough review of half a decade of advancements in ASO research, synthesizing a wide range of studies to highlight key ASO variants, their foundational principles, and significant achievements. It examines diverse applications, including single- and multi-objective optimization problems, and introduces a well-structured taxonomy to guide future exploration in ASO-related research. The reviewed literature reveals that several variants of the ASO algorithm, including modifications, hybridizations, and multi-objective implementations, have been developed to tackle complex optimization problems. Moreover, ASO has been effectively applied across various domains, such as engineering, healthcare and medical applications, Internet of Things and communication, clustering and data mining, environmental modeling, and security, with engineering emerging as the most prevalent application area. By addressing the common challenges researchers face in selecting appropriate algorithms for real-world problems, this study provides valuable insights into the practical applications of ASO and offers guidance for designing ASO variants tailored to specific optimization problems.
- Open Access
- 1 January 2025
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 142 (3) , 2339-2404
Stochastic Fractal Search: A Decade Comprehensive Review on Its Theory, Variants, and Applications
With the rapid advancements in technology and science, optimization theory and algorithms have become increasingly important. A wide range of real-world problems is classified as optimization challenges, and meta-heuristic al... | Find, read and cite all the research you need on Tech Science Press
- 1 January 2025
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 142 (3) , 2339-2404
Open AccessStochastic Fractal Search: A Decade Comprehensive Review on Its Theory, Variants, and Applications
With the rapid advancements in technology and science, optimization theory and algorithms have become increasingly important. A wide range of real-world problems is classified as optimization challenges, and meta-heuristic al... | Find, read and cite all the research you need on Tech Science Press
- Top Cited PapersOpen Access
- 17 October 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (12) , 1-51
Recent applications and advances of African Vultures Optimization Algorithm
The African Vultures Optimization Algorithm (AVOA) is a recently developed meta-heuristic algorithm inspired by the foraging behavior of African vultures in nature. This algorithm has gained attention due to its simplicity, flexibility, and effectiveness in tackling many optimization problems. The significance of this review lies in its comprehensive examination of the AVOA’s development, core principles, and applications. By analyzing 112 studies, this review highlights the algorithm’s versatility and the growing interest in enhancing its performance for real-world optimization challenges. This review methodically explores the evolution of AVOA, investigating proposed improvements that enhance the algorithm’s ability to adapt to various search geometries in optimization problems. Additionally, it introduces the AVOA solver, detailing its functionality and application in different optimization scenarios. The review demonstrates the AVOA’s effectiveness, particularly its unique weighting mechanism, which mimics vulture behavior during the search process. The findings underscore the algorithm’s robustness, ease of use, and lack of dependence on derivative information. The review also critically evaluates the AVOA’s convergence behavior, identifying its strengths and limitations. In conclusion, the study not only consolidates the existing knowledge on AVOA but also proposes directions for future research, including potential adaptations and enhancements to address its limitations. The insights gained from this review offer valuable guidance for researchers and practitioners seeking to apply or improve the AVOA in various optimization tasks.
- 17 October 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (12) , 1-51
Top Cited PapersOpen AccessRecent applications and advances of African Vultures Optimization Algorithm
The African Vultures Optimization Algorithm (AVOA) is a recently developed meta-heuristic algorithm inspired by the foraging behavior of African vultures in nature. This algorithm has gained attention due to its simplicity, flexibility, and effectiveness in tackling many optimization problems. The significance of this review lies in its comprehensive examination of the AVOA’s development, core principles, and applications. By analyzing 112 studies, this review highlights the algorithm’s versatility and the growing interest in enhancing its performance for real-world optimization challenges. This review methodically explores the evolution of AVOA, investigating proposed improvements that enhance the algorithm’s ability to adapt to various search geometries in optimization problems. Additionally, it introduces the AVOA solver, detailing its functionality and application in different optimization scenarios. The review demonstrates the AVOA’s effectiveness, particularly its unique weighting mechanism, which mimics vulture behavior during the search process. The findings underscore the algorithm’s robustness, ease of use, and lack of dependence on derivative information. The review also critically evaluates the AVOA’s convergence behavior, identifying its strengths and limitations. In conclusion, the study not only consolidates the existing knowledge on AVOA but also proposes directions for future research, including potential adaptations and enhancements to address its limitations. The insights gained from this review offer valuable guidance for researchers and practitioners seeking to apply or improve the AVOA in various optimization tasks.
- 1 October 2024
- Published by Springer Nature in Neural Computing and Applications
- Vol. 36 (36) , 22999-23030
Optimal renewable distributed generation planning in radial distribution systems: a probabilistic and multi-objective approach with enhanced Young’s double-slit experiment optimizer
- 1 October 2024
- Published by Springer Nature in Neural Computing and Applications
- Vol. 36 (36) , 22999-23030
Optimal renewable distributed generation planning in radial distribution systems: a probabilistic and multi-objective approach with enhanced Young’s double-slit experiment optimizer
- Open Access
- 12 August 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (9) , 1-78
An in-depth survey of the artificial gorilla troops optimizer: outcomes, variations, and applications
A recently developed algorithm inspired by natural processes, known as the Artificial Gorilla Troops Optimizer (GTO), boasts a straightforward structure, unique stabilizing features, and notably high effectiveness. Its primary objective is to efficiently find solutions for a wide array of challenges, whether they involve constraints or not. The GTO takes its inspiration from the behavior of Gorilla Troops in the natural world. To emulate the impact of gorillas at each stage of the search process, the GTO employs a flexible weighting mechanism rooted in its concept. Its exceptional qualities, including its independence from derivatives, lack of parameters, user-friendliness, adaptability, and simplicity, have resulted in its rapid adoption for addressing various optimization challenges. This review is dedicated to the examination and discussion of the foundational research that forms the basis of the GTO. It delves into the evolution of this algorithm, drawing insights from 112 research studies that highlight its effectiveness. Additionally, it explores proposed enhancements to the GTO’s behavior, with a specific focus on aligning the geometry of the search area with real-world optimization problems. The review also introduces the GTO solver, providing details about its identification and organization, and demonstrates its application in various optimization scenarios. Furthermore, it provides a critical assessment of the convergence behavior while addressing the primary limitation of the GTO. In conclusion, this review summarizes the key findings of the study and suggests potential avenues for future advancements and adaptations related to the GTO.
- 12 August 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (9) , 1-78
Open AccessAn in-depth survey of the artificial gorilla troops optimizer: outcomes, variations, and applications
A recently developed algorithm inspired by natural processes, known as the Artificial Gorilla Troops Optimizer (GTO), boasts a straightforward structure, unique stabilizing features, and notably high effectiveness. Its primary objective is to efficiently find solutions for a wide array of challenges, whether they involve constraints or not. The GTO takes its inspiration from the behavior of Gorilla Troops in the natural world. To emulate the impact of gorillas at each stage of the search process, the GTO employs a flexible weighting mechanism rooted in its concept. Its exceptional qualities, including its independence from derivatives, lack of parameters, user-friendliness, adaptability, and simplicity, have resulted in its rapid adoption for addressing various optimization challenges. This review is dedicated to the examination and discussion of the foundational research that forms the basis of the GTO. It delves into the evolution of this algorithm, drawing insights from 112 research studies that highlight its effectiveness. Additionally, it explores proposed enhancements to the GTO’s behavior, with a specific focus on aligning the geometry of the search area with real-world optimization problems. The review also introduces the GTO solver, providing details about its identification and organization, and demonstrates its application in various optimization scenarios. Furthermore, it provides a critical assessment of the convergence behavior while addressing the primary limitation of the GTO. In conclusion, this review summarizes the key findings of the study and suggests potential avenues for future advancements and adaptations related to the GTO.
- Top Cited Papers
- 16 May 2024
- Published by Springer Nature in Neural Computing and Applications
- p. 1-59
Pied kingfisher optimizer: a new bio-inspired algorithm for solving numerical optimization and industrial engineering problems
- 16 May 2024
- Published by Springer Nature in Neural Computing and Applications
- p. 1-59
Top Cited PapersPied kingfisher optimizer: a new bio-inspired algorithm for solving numerical optimization and industrial engineering problems
- Top Cited Papers
- 16 March 2022
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 29 (6) , 4049-4083
Hybrid Meta-Heuristic Algorithms for Optimal Sizing of Hybrid Renewable Energy System: A Review of the State-of-the-Art
The hybrid renewable energy system (HRES) has been presented as the most studied solution for improving the sustainability of energy production infrastructures in isolated areas. With the rapid growth of HRES markets, various issues and aspects must be taken into consideration when the major working about the hybridization of renewable energy sources, consequently optimization problem solving for this system is a requirement. Therefore, this paper presents a state-of-the-art review of hybrid meta-heuristic algorithms applied for the optimal size of HRES. The relevant literature source and their distribution are presented firstly. We then review the literature from two viewpoints, including existing applied hybrid meta-heuristic algorithms for single-objective and for multi-objective design. Finally, some promising paths ranging from improving algorithms to technical applications are outlined to encourage researchers to conduct research in related fields. Graphical Abstract
- 16 March 2022
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 29 (6) , 4049-4083
Top Cited PapersHybrid Meta-Heuristic Algorithms for Optimal Sizing of Hybrid Renewable Energy System: A Review of the State-of-the-Art
The hybrid renewable energy system (HRES) has been presented as the most studied solution for improving the sustainability of energy production infrastructures in isolated areas. With the rapid growth of HRES markets, various issues and aspects must be taken into consideration when the major working about the hybridization of renewable energy sources, consequently optimization problem solving for this system is a requirement. Therefore, this paper presents a state-of-the-art review of hybrid meta-heuristic algorithms applied for the optimal size of HRES. The relevant literature source and their distribution are presented firstly. We then review the literature from two viewpoints, including existing applied hybrid meta-heuristic algorithms for single-objective and for multi-objective design. Finally, some promising paths ranging from improving algorithms to technical applications are outlined to encourage researchers to conduct research in related fields. Graphical Abstract