Hoda Zamani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hoda Zamani has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Mohammad Hossein Nadimi Shahraki
International Graduate School of Artificial Intelligence, National Yunlin University of Science and Technology, Yunlin, Taiwan
15 shared publications - Seyedali Mirjalili
Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, Brisbane, Australia
8 shared publications - Ali Fatahi
Faculty of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad 8514143131, Iran
5 shared publications - Amir Hossein Gandomi
Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, Australia
3 shared publications Seyedali Mirjalili
Centre for Artificial Intelligence Research and Optimisation, Torrens University, Torrens, Australia
3 shared publications- Zahra Asghari Varzaneh
Department of Computer Science and Media Technology, Sustainable Digitalisation Research Center, Malmö University, Malmö, Sweden
3 shared publications
Latest Publications
- Open Access
- 3 June 2026
- Published by Elsevier in Systems and Soft Computing
- Vol. 9
An enhanced memory-based metaheuristic for optimization of large-scale truss structures
- 3 June 2026
- Published by Elsevier in Systems and Soft Computing
- Vol. 9
Open AccessAn enhanced memory-based metaheuristic for optimization of large-scale truss structures
- Open Access
- 30 September 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-41
Evolutionary salp swarm algorithm with multi-search strategies and advanced memory mechanism for solving global optimization and complex engineering problems
Real-world optimization problems, such as global optimization, cleaner production system, and complex design challenges are inherently complex, involving many variables and constraints. These factors make it challenging for optimizers to determine optimal solutions efficiently. Salp Swarm Algorithm (SSA) adapts easily to complex optimization problems due to its simplicity, multi-search strategy, and few control parameters. However, its search strategy lacks precision in guiding the population toward optimal regions of the solution space, which limits its effectiveness in optimizing cleaner production systems and complex design problems. This study proposes an evolutionary SSA (ESSA) to address complex optimization problems. ESSA proposes distinct innovative search strategies, including two evolutionary search strategies that enhance diversity and adaptive search, as well as an enhanced SSA search strategy that, while less exploratory, ensures steady convergence. ESSA introduces an advanced memory mechanism that stores the best and inferior solutions identified during optimization, enhancing diversity and preventing premature convergence. Moreover, it incorporates a stochastic universal selection method to regulate the archive by selecting individuals according to their fitness values. The performance of ESSA was evaluated using benchmark functions CEC 2017 and CEC 2020, compared to seven leading algorithms. Results show that ESSA outperforms SSA and others in solution quality and convergence speed. Statistical analyses confirm that ESSA ranks first and achieves the best optimization effectiveness, with values of 84.48%, 96.55%, and 89.66% for dimensions 30, 50, and 100, respectively, surpassing other optimizers. Additionally, ESSA’s practical applicability is demonstrated through its success in optimizing a cleaner production system and solving complex design problems, highlighting its effectiveness in tackling challenging optimization tasks.
- 30 September 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-41
Open AccessEvolutionary salp swarm algorithm with multi-search strategies and advanced memory mechanism for solving global optimization and complex engineering problems
Real-world optimization problems, such as global optimization, cleaner production system, and complex design challenges are inherently complex, involving many variables and constraints. These factors make it challenging for optimizers to determine optimal solutions efficiently. Salp Swarm Algorithm (SSA) adapts easily to complex optimization problems due to its simplicity, multi-search strategy, and few control parameters. However, its search strategy lacks precision in guiding the population toward optimal regions of the solution space, which limits its effectiveness in optimizing cleaner production systems and complex design problems. This study proposes an evolutionary SSA (ESSA) to address complex optimization problems. ESSA proposes distinct innovative search strategies, including two evolutionary search strategies that enhance diversity and adaptive search, as well as an enhanced SSA search strategy that, while less exploratory, ensures steady convergence. ESSA introduces an advanced memory mechanism that stores the best and inferior solutions identified during optimization, enhancing diversity and preventing premature convergence. Moreover, it incorporates a stochastic universal selection method to regulate the archive by selecting individuals according to their fitness values. The performance of ESSA was evaluated using benchmark functions CEC 2017 and CEC 2020, compared to seven leading algorithms. Results show that ESSA outperforms SSA and others in solution quality and convergence speed. Statistical analyses confirm that ESSA ranks first and achieves the best optimization effectiveness, with values of 84.48%, 96.55%, and 89.66% for dimensions 30, 50, and 100, respectively, surpassing other optimizers. Additionally, ESSA’s practical applicability is demonstrated through its success in optimizing a cleaner production system and solving complex design problems, highlighting its effectiveness in tackling challenging optimization tasks.
- Open Access
- 24 September 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (19) , 3068
Conscious Neighborhood-Based Jellyfish Search Optimizer for Solving Optimal Power Flow Problems
Optimal Power Flow (OPF) problems are essential in power system planning, but their nonlinear and large-scale nature makes them difficult to solve with traditional optimization methods. Metaheuristic algorithms have become increasingly popular for solving OPF problems due to their ability to handle complex search spaces and multiple objectives. The Jellyfish Search Optimizer (JSO) is a metaheuristic algorithm that performs well for solving various optimization problems. However, it suffers from low exploration and an imbalance between exploration and exploitation. Therefore, this study introduces an improved JSO called Conscious Neighborhood-based JSO (CNJSO) to address these shortcomings. The proposed CNJSO suggests a new movement strategy named Best archive and Non-neighborhood-based Global Search (BNGS) to enhance the exploration ability. In addition, CNJSO adapts the concept of conscious neighborhood and the Wandering Around Search (WAS) strategy. The proposed CNJSO facilitates exploration of the search space and strikes a suitable balance between exploration and exploitation. The performance of CNJSO was evaluated on CEC 2018 benchmark functions, and the results were compared with those of ten state-of-the-art metaheuristic algorithms. In addition, the results were statistically validated using the Wilcoxon rank-sum and Friedman tests. Additionally, the effectiveness of CNJSO was assessed through the resolution of OPF problems. The experimental and statistical results confirm that the proposed CNJSO algorithm is competitive and superior to the compared algorithms.
- 24 September 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (19) , 3068
Open AccessConscious Neighborhood-Based Jellyfish Search Optimizer for Solving Optimal Power Flow Problems
Optimal Power Flow (OPF) problems are essential in power system planning, but their nonlinear and large-scale nature makes them difficult to solve with traditional optimization methods. Metaheuristic algorithms have become increasingly popular for solving OPF problems due to their ability to handle complex search spaces and multiple objectives. The Jellyfish Search Optimizer (JSO) is a metaheuristic algorithm that performs well for solving various optimization problems. However, it suffers from low exploration and an imbalance between exploration and exploitation. Therefore, this study introduces an improved JSO called Conscious Neighborhood-based JSO (CNJSO) to address these shortcomings. The proposed CNJSO suggests a new movement strategy named Best archive and Non-neighborhood-based Global Search (BNGS) to enhance the exploration ability. In addition, CNJSO adapts the concept of conscious neighborhood and the Wandering Around Search (WAS) strategy. The proposed CNJSO facilitates exploration of the search space and strikes a suitable balance between exploration and exploitation. The performance of CNJSO was evaluated on CEC 2018 benchmark functions, and the results were compared with those of ten state-of-the-art metaheuristic algorithms. In addition, the results were statistically validated using the Wilcoxon rank-sum and Friedman tests. Additionally, the effectiveness of CNJSO was assessed through the resolution of OPF problems. The experimental and statistical results confirm that the proposed CNJSO algorithm is competitive and superior to the compared algorithms.
- 21 August 2024
- Published by Springer Nature
- p. 182-196
Massive Conscious Neighborhood-Based Crow Search Algorithm for the Pseudo-Coloring Problem
- 21 August 2024
- Published by Springer Nature
- p. 182-196
Massive Conscious Neighborhood-Based Crow Search Algorithm for the Pseudo-Coloring Problem
- 21 August 2024
- Published by Springer Nature
- p. 247-262
Metaheuristic Algorithms for Enhancing Multicepstral Representation in Voice Spoofing Detection: An Experimental Approach
- 21 August 2024
- Published by Springer Nature
- p. 247-262
Metaheuristic Algorithms for Enhancing Multicepstral Representation in Voice Spoofing Detection: An Experimental Approach
- 22 February 2024
- Published by Elsevier in Internet of Things
- Vol. 26, 101135
A systematic review of applying grey wolf optimizer, its variants, and its developments in different Internet of Things applications
- 22 February 2024
- Published by Elsevier in Internet of Things
- Vol. 26, 101135
A systematic review of applying grey wolf optimizer, its variants, and its developments in different Internet of Things applications
- Top Cited Papers
- 2 February 2024
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 31 (4) , 2177-2225
A Critical Review of Moth-Flame Optimization Algorithm and Its Variants: Structural Reviewing, Performance Evaluation, and Statistical Analysis
- 2 February 2024
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 31 (4) , 2177-2225
Top Cited PapersA Critical Review of Moth-Flame Optimization Algorithm and Its Variants: Structural Reviewing, Performance Evaluation, and Statistical Analysis
- Open Access
- 8 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (4) , 862
MFO-SFR: An Enhanced Moth-Flame Optimization Algorithm Using an Effective Stagnation Finding and Replacing Strategy
Moth-flame optimization (MFO) is a prominent problem solver with a simple structure that is widely used to solve different optimization problems. However, MFO and its variants inherently suffer from poor population diversity, leading to premature convergence to local optima and losses in the quality of its solutions. To overcome these limitations, an enhanced moth-flame optimization algorithm named MFO-SFR was developed to solve global optimization problems. The MFO-SFR algorithm introduces an effective stagnation finding and replacing (SFR) strategy to effectively maintain population diversity throughout the optimization process. The SFR strategy can find stagnant solutions using a distance-based technique and replaces them with a selected solution from the archive constructed from the previous solutions. The effectiveness of the proposed MFO-SFR algorithm was extensively assessed in 30 and 50 dimensions using the CEC 2018 benchmark functions, which simulated unimodal, multimodal, hybrid, and composition problems. Then, the obtained results were compared with two sets of competitors. In the first comparative set, the MFO algorithm and its well-known variants, specifically LMFO, WCMFO, CMFO, ODSFMFO, SMFO, and WMFO, were considered. Five state-of-the-art metaheuristic algorithms, including PSO, KH, GWO, CSA, and HOA, were considered in the second comparative set. The results were then statistically analyzed through the Friedman test. Ultimately, the capacity of the proposed algorithm to solve mechanical engineering problems was evaluated with two problems from the latest CEC 2020 test-suite. The experimental results and statistical analysis confirmed that the proposed MFO-SFR algorithm was superior to the MFO variants and state-of-the-art metaheuristic algorithms for solving complex global optimization problems, with 91.38% effectiveness.
- 8 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (4) , 862
Open AccessMFO-SFR: An Enhanced Moth-Flame Optimization Algorithm Using an Effective Stagnation Finding and Replacing Strategy
Moth-flame optimization (MFO) is a prominent problem solver with a simple structure that is widely used to solve different optimization problems. However, MFO and its variants inherently suffer from poor population diversity, leading to premature convergence to local optima and losses in the quality of its solutions. To overcome these limitations, an enhanced moth-flame optimization algorithm named MFO-SFR was developed to solve global optimization problems. The MFO-SFR algorithm introduces an effective stagnation finding and replacing (SFR) strategy to effectively maintain population diversity throughout the optimization process. The SFR strategy can find stagnant solutions using a distance-based technique and replaces them with a selected solution from the archive constructed from the previous solutions. The effectiveness of the proposed MFO-SFR algorithm was extensively assessed in 30 and 50 dimensions using the CEC 2018 benchmark functions, which simulated unimodal, multimodal, hybrid, and composition problems. Then, the obtained results were compared with two sets of competitors. In the first comparative set, the MFO algorithm and its well-known variants, specifically LMFO, WCMFO, CMFO, ODSFMFO, SMFO, and WMFO, were considered. Five state-of-the-art metaheuristic algorithms, including PSO, KH, GWO, CSA, and HOA, were considered in the second comparative set. The results were then statistically analyzed through the Friedman test. Ultimately, the capacity of the proposed algorithm to solve mechanical engineering problems was evaluated with two problems from the latest CEC 2020 test-suite. The experimental results and statistical analysis confirmed that the proposed MFO-SFR algorithm was superior to the MFO variants and state-of-the-art metaheuristic algorithms for solving complex global optimization problems, with 91.38% effectiveness.