Farouq Zitouni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Farouq Zitouni has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Saad Harous
Department of Computer science, University of Sharjah, Sharjah, United Arab Emirates
15 shared publications - Ramdane Maamri
LIRE Laboratory, Abdelhamid Mehri University, Constantine, Algeria
6 shared publications - Abdelhadi Limane
Department of Computer Science and Information Technology, Kasdi Merbah University, Ouargla, Algeria
5 shared publications - Rihab Lakbichi
Department of Computer Science and Information Technology, Kasdi Merbah University, Ouargla, Algeria
5 shared publications - Aridj Ferhat
Department of Computer Science and Information Technology, Kasdi Merbah University, Ouargla, Algeria
4 shared publications Ramdane Maamri
Department of Computer Science, Abdelhamid Mehri University, LIRE Laboratory, Abdelhamid Mehri University
4 shared publications
Latest Publications
- Open Access
- 18 September 2026
- Published by Elsevier in Results in Engineering
- Vol. 32
Enhancing the centered collision optimizer with success-history based adaptive differential evolution for efficient parameter estimation of proton exchange membrane fuel cells
- 18 September 2026
- Published by Elsevier in Results in Engineering
- Vol. 32
Open AccessEnhancing the centered collision optimizer with success-history based adaptive differential evolution for efficient parameter estimation of proton exchange membrane fuel cells
- 17 September 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (13) , 756
NN-IMODE: a novel approach for simultaneous optimization of architecture and parameters in feedforward neural networks
- 17 September 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (13) , 756
NN-IMODE: a novel approach for simultaneous optimization of architecture and parameters in feedforward neural networks
- 19 November 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 129
Prosumers matching and energy routing through Yens and SOS algorithms in P2P energy trading systems
- 19 November 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 129
Prosumers matching and energy routing through Yens and SOS algorithms in P2P energy trading systems
- Open Access
- 15 July 2025
- Published by PeerJ in PeerJ Computer Science
- Vol. 11, e2935
Opposition-based learning techniques in metaheuristics: classification, comparison, and convergence analysis
In recent years, opposition-based learning (OBL) has emerged as a powerful enhancement strategy in metaheuristic algorithms (MAs), gaining significant attention for its potential to accelerate convergence and improve solution quality. Existing research lacks a structured analysis of how different OBL variants influence optimization performance when integrated into various MAs. This study categorizes and analyzes nine distinct OBL techniques: basic opposition-based learning, quasi-opposition-based learning, generalized opposition-based learning, current optimum opposition-based learning, quasi-reflection opposition-based learning, centroid opposition-based learning, random opposition-based learning, super opposition-based learning, and stochastic opposition-based learning. To systematically assess the effectiveness of these techniques, five widely used OBL variants—basic opposition-based learning, quasi-opposition-based learning, generalized opposition-based learning, current optimum opposition-based learning, quasi-reflection opposition-based learning—were selected for implementation within five well-established MAs: differential evolution, genetic algorithm, particle swarm optimization, artificial bee colony, and harmony search. These hybridized algorithms were evaluated across different integration phases, including the initialization passes and generation updates phase, and in both phases. To experimentally demonstrate the capability of OBL strategies to enhance MAs that face common issues such as slow convergence, limited exploration, and imbalanced exploration-exploitation, we have used 12 benchmark functions from CEC2022 suite. Key performance metrics—including maximum, minimum, mean, standard deviation, and convergence curves—were rigorously analyzed to quantify the improvements introduced by each OBL-enhanced MA. Additionally, a Friedman test was conducted to statistically validate the performance differences among the variants. The results indicate that quasi-reflection opposition-based learning consistently outperforms other OBL variants, demonstrating superior convergence speed and solution quality across most benchmark functions.
- 15 July 2025
- Published by PeerJ in PeerJ Computer Science
- Vol. 11, e2935
Open AccessOpposition-based learning techniques in metaheuristics: classification, comparison, and convergence analysis
In recent years, opposition-based learning (OBL) has emerged as a powerful enhancement strategy in metaheuristic algorithms (MAs), gaining significant attention for its potential to accelerate convergence and improve solution quality. Existing research lacks a structured analysis of how different OBL variants influence optimization performance when integrated into various MAs. This study categorizes and analyzes nine distinct OBL techniques: basic opposition-based learning, quasi-opposition-based learning, generalized opposition-based learning, current optimum opposition-based learning, quasi-reflection opposition-based learning, centroid opposition-based learning, random opposition-based learning, super opposition-based learning, and stochastic opposition-based learning. To systematically assess the effectiveness of these techniques, five widely used OBL variants—basic opposition-based learning, quasi-opposition-based learning, generalized opposition-based learning, current optimum opposition-based learning, quasi-reflection opposition-based learning—were selected for implementation within five well-established MAs: differential evolution, genetic algorithm, particle swarm optimization, artificial bee colony, and harmony search. These hybridized algorithms were evaluated across different integration phases, including the initialization passes and generation updates phase, and in both phases. To experimentally demonstrate the capability of OBL strategies to enhance MAs that face common issues such as slow convergence, limited exploration, and imbalanced exploration-exploitation, we have used 12 benchmark functions from CEC2022 suite. Key performance metrics—including maximum, minimum, mean, standard deviation, and convergence curves—were rigorously analyzed to quantify the improvements introduced by each OBL-enhanced MA. Additionally, a Friedman test was conducted to statistically validate the performance differences among the variants. The results indicate that quasi-reflection opposition-based learning consistently outperforms other OBL variants, demonstrating superior convergence speed and solution quality across most benchmark functions.
- 7 July 2025
- Published by Springer Nature in Memetic Computing
- Vol. 17 (3) , 1-42
Measures of exploration and exploitation rates in MAs: classification, comparison, and convergence analysis
- 7 July 2025
- Published by Springer Nature in Memetic Computing
- Vol. 17 (3) , 1-42
Measures of exploration and exploitation rates in MAs: classification, comparison, and convergence analysis
- Open Access
- 19 February 2025
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 11 (3) , 1-42
Chaos-enhanced metaheuristics: classification, comparison, and convergence analysis
- 19 February 2025
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 11 (3) , 1-42
Open AccessChaos-enhanced metaheuristics: classification, comparison, and convergence analysis
- Open Access
- 27 January 2025
- Published by PeerJ in PeerJ Computer Science
- Vol. 11, e2646
A comparative study of the performance of ten metaheuristic algorithms for parameter estimation of solar photovoltaic models
This study conducts a comparative analysis of the performance of ten novel and well-performing metaheuristic algorithms for parameter estimation of solar photovoltaic models. This optimization problem involves accurately identifying parameters that reflect the complex and nonlinear behaviours of photovoltaic cells affected by changing environmental conditions and material inconsistencies. This estimation is challenging due to computational complexity and the risk of optimization errors, which can hinder reliable performance predictions. The algorithms evaluated include the Crayfish Optimization Algorithm, the Golf Optimization Algorithm, the Coati Optimization Algorithm, the Crested Porcupine Optimizer, the Growth Optimizer, the Artificial Protozoa Optimizer, the Secretary Bird Optimization Algorithm, the Mother Optimization Algorithm, the Election Optimizer Algorithm, and the Technical and Vocational Education and Training-Based Optimizer. These algorithms are applied to solve four well-established photovoltaic models: the single-diode model, the double-diode model, the triple-diode model, and different photovoltaic module models. The study focuses on key performance metrics such as execution time, number of function evaluations, and solution optimality. The results reveal significant differences in the efficiency and accuracy of the algorithms, with some algorithms demonstrating superior performance in specific models. The Friedman test was utilized to rank the performance of the various algorithms, revealing the Growth Optimizer as the top performer across all the considered models. This optimizer achieved a root mean square error of 9.8602187789E−04 for the single-diode model, 9.8248487610E−04 for both the double-diode and triple-diode models and 1.2307306856E−02 for the photovoltaic module model. This consistent success indicates that the Growth Optimizer is a strong contender for future enhancements aimed at further boosting its efficiency and effectiveness. Its current performance suggests significant potential for improvement, making it a promising focus for ongoing development efforts. The findings contribute to the understanding of the applicability and performance of metaheuristic algorithms in renewable energy systems, providing valuable insights for optimizing photovoltaic models.
- 27 January 2025
- Published by PeerJ in PeerJ Computer Science
- Vol. 11, e2646
Open AccessA comparative study of the performance of ten metaheuristic algorithms for parameter estimation of solar photovoltaic models
This study conducts a comparative analysis of the performance of ten novel and well-performing metaheuristic algorithms for parameter estimation of solar photovoltaic models. This optimization problem involves accurately identifying parameters that reflect the complex and nonlinear behaviours of photovoltaic cells affected by changing environmental conditions and material inconsistencies. This estimation is challenging due to computational complexity and the risk of optimization errors, which can hinder reliable performance predictions. The algorithms evaluated include the Crayfish Optimization Algorithm, the Golf Optimization Algorithm, the Coati Optimization Algorithm, the Crested Porcupine Optimizer, the Growth Optimizer, the Artificial Protozoa Optimizer, the Secretary Bird Optimization Algorithm, the Mother Optimization Algorithm, the Election Optimizer Algorithm, and the Technical and Vocational Education and Training-Based Optimizer. These algorithms are applied to solve four well-established photovoltaic models: the single-diode model, the double-diode model, the triple-diode model, and different photovoltaic module models. The study focuses on key performance metrics such as execution time, number of function evaluations, and solution optimality. The results reveal significant differences in the efficiency and accuracy of the algorithms, with some algorithms demonstrating superior performance in specific models. The Friedman test was utilized to rank the performance of the various algorithms, revealing the Growth Optimizer as the top performer across all the considered models. This optimizer achieved a root mean square error of 9.8602187789E−04 for the single-diode model, 9.8248487610E−04 for both the double-diode and triple-diode models and 1.2307306856E−02 for the photovoltaic module model. This consistent success indicates that the Growth Optimizer is a strong contender for future enhancements aimed at further boosting its efficiency and effectiveness. Its current performance suggests significant potential for improvement, making it a promising focus for ongoing development efforts. The findings contribute to the understanding of the applicability and performance of metaheuristic algorithms in renewable energy systems, providing valuable insights for optimizing photovoltaic models.
- Open Access
- 30 August 2024
- Published by Atlantis Press SARL
- p. 19-36
The Walking Palm Tree algorithm: A new Metaheuristic Algorithm for Solving Optimization Problems
- 30 August 2024
- Published by Atlantis Press SARL
- p. 19-36
Open AccessThe Walking Palm Tree algorithm: A new Metaheuristic Algorithm for Solving Optimization Problems