Zeinab Montazeri

Dr. Zeinab Montazeri


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 January 2024 in Biomimetics
Verified
Journal Article
Open access
PDF file
OAOsama Al-Baik
Osama Al-Baik
SASALEH ALOMARI
SALEH ALOMARI
OAOmar Alsayyed
Omar Alsayyed
Saikat GochhaitSaikat Gochhait
Saikat Gochhait
ILIrina Leonova
Irina Leonova
Mohammad DehghaniMohammad Dehghani
Mohammad Dehghani
A new bio-inspired metaheuristic algorithm named the Pufferfish Optimization Algorithm (POA), that imitates the natural behavior of pufferfish in nature, is introduced in this paper. The fundamental inspiration of POA is adapted from the defense mechanism of pufferfish against predators. In this defense mechanism, by filling its elastic stomach with water, the pufferfish becomes a spherical ball with pointed spines, and as a result, the hungry predator escapes from this threat. The POA theory is stated and then mathematically modeled in two phases: (i) exploration based on the simulation of a predator’s attack on a pufferfish and (ii) exploitation based on the simulation of a predator’s escape from spiny spherical pufferfish. The performance of POA is evaluated in handling the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that POA has achieved an effective solution with the appropriate ability in exploration, exploitation, and the balance between them during the search process. The quality of POA in the optimization process is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that POA provides superior performance by achieving better results in most of the benchmark functions in order to solve the CEC 2017 test suite compared to competitor algorithms. Also, the effectiveness of POA to handle optimization tasks in real-world applications is evaluated on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. Simulation results show that POA provides effective performance in handling real-world applications by achieving better solutions compared to competitor algorithms.

23 October 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
Mohammad DehghaniMohammad Dehghani
Mohammad Dehghani
GBGulnara Umitkulovna Bektemyssova
Gulnara Umitkulovna Bektemyssova
ZMZeinab Montazeri
Zeinab Montazeri
GSGalymzhan Shaikemelev
Galymzhan Shaikemelev
OMOm Malik
Om Malik
GDGAURAV DHIMAN
GAURAV DHIMAN
In this paper, a new bio-inspired metaheuristic algorithm called the Lyrebird Optimization Algorithm (LOA) that imitates the natural behavior of lyrebirds in the wild is introduced. The fundamental inspiration of LOA is the strategy of lyrebirds when faced with danger. In this situation, lyrebirds scan their surroundings carefully, then either run away or hide somewhere, immobile. LOA theory is described and then mathematically modeled in two phases: (i) exploration based on simulation of the lyrebird escape strategy and (ii) exploitation based on simulation of the hiding strategy. The performance of LOA was evaluated in optimization of the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that the proposed LOA approach has high ability in terms of exploration, exploitation, and balancing them during the search process in the problem-solving space. In order to evaluate the capability of LOA in dealing with optimization tasks, the results obtained from the proposed approach were compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that LOA has superior performance compared to competitor algorithms by providing better results in the optimization of most of the benchmark functions, achieving the rank of first best optimizer. A statistical analysis of the performance of the metaheuristic algorithms shows that LOA has significant statistical superiority in comparison with the compared algorithms. In addition, the efficiency of LOA in handling real-world applications was investigated through dealing with twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. The simulation results show that LOA has effective performance in handling optimization tasks in real-world applications while providing better results compared to competitor algorithms.

4 September 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Mohammad DehghaniMohammad Dehghani
Mohammad Dehghani
ZMZeinab Montazeri
Zeinab Montazeri
GDGAURAV DHIMAN
GAURAV DHIMAN
OMOm Malik
Om Malik
Ruben Morales-MenendezRuben Morales-Menendez
Ruben Morales-Menendez
LPLizeth Parra-Arroyo
Lizeth Parra-Arroyo
At present, optimization algorithms are used extensively. One particular type of such algorithms includes random-based heuristic population optimization algorithms, which may be created by modeling scientific phenomena, like, for example, physical processes. The present article proposes a novel optimization algorithm based on Hooke’s law, called the spring search algorithm (SSA), which aims to solve single-objective constrained optimization problems. In the SSA, search agents are weights joined through springs, which, as Hooke’s law states, possess a force that corresponds to its length. The mathematics behind the algorithm are presented in the text. In order to test its functionality, it is executed on 38 established benchmark test functions and weighed against eight other optimization algorithms: a genetic algorithm (GA), a gravitational search algorithm (GSA), a grasshopper optimization algorithm (GOA), particle swarm optimization (PSO), teaching–learning-based optimization (TLBO), a grey wolf optimizer (GWO), a spotted hyena optimizer (SHO), as well as an emperor penguin optimizer (EPO). To test the SSA’s usability, it is employed on five engineering optimization problems. The SSA delivered better fitting results than the other algorithms in unimodal objective function, multimodal objective functions, CEC 2015, in addition to the optimization problems in engineering.

24 August 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
ZMZeinab Montazeri
Zeinab Montazeri
TNTaher Niknam
Taher Niknam
JAJamshid Aghaei
Jamshid Aghaei
OMOm Malik
Om Malik
Mohammad DehghaniMohammad Dehghani
Mohammad Dehghani
GDGAURAV DHIMAN
GAURAV DHIMAN
In this research article, we uphold the principles of the No Free Lunch theorem and employ it as a driving force to introduce an innovative game-based metaheuristic technique named Golf Optimization Algorithm (GOA). The GOA is meticulously structured with two distinctive phases, namely, exploration and exploitation, drawing inspiration from the strategic dynamics and player conduct observed in the sport of golf. Through comprehensive assessments encompassing fifty-two objective functions and four real-world engineering applications, the efficacy of the GOA is rigorously examined. The results of the optimization process reveal GOA’s exceptional proficiency in both exploration and exploitation strategies, effectively striking a harmonious equilibrium between the two. Comparative analyses against ten competing algorithms demonstrate a clear and statistically significant superiority of the GOA across a spectrum of performance metrics. Furthermore, the successful application of the GOA to the intricate energy commitment problem, considering network resilience, underscores its prowess in addressing complex engineering challenges. For the convenience of the research community, we provide the MATLAB implementation codes for the proposed GOA methodology, ensuring accessibility and facilitating further exploration.

1 October 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
Mohammad DehghaniMohammad Dehghani
Mohammad Dehghani
ZMZeinab Montazeri
Zeinab Montazeri
GBGulnara Umitkulovna Bektemyssova
Gulnara Umitkulovna Bektemyssova
OMOm Malik
Om Malik
GDGAURAV DHIMAN
GAURAV DHIMAN
AAAyman Elshabrawy M Ahmed
Ayman Elshabrawy M Ahmed
In this paper, a new bio-inspired metaheuristic algorithm named the Kookaburra Optimization Algorithm (KOA) is introduced, which imitates the natural behavior of kookaburras in nature. The fundamental inspiration of KOA is the strategy of kookaburras when hunting and killing prey. The KOA theory is stated, and its mathematical modeling is presented in the following two phases: (i) exploration based on the simulation of prey hunting and (ii) exploitation based on the simulation of kookaburras’ behavior in ensuring that their prey is killed. The performance of KOA has been evaluated on 29 standard benchmark functions from the CEC 2017 test suite for the different problem dimensions of 10, 30, 50, and 100. The optimization results show that the proposed KOA approach, by establishing a balance between exploration and exploitation, has good efficiency in managing the effective search process and providing suitable solutions for optimization problems. The results obtained using KOA have been compared with the performance of 12 well-known metaheuristic algorithms. The analysis of the simulation results shows that KOA, by providing better results in most of the benchmark functions, has provided superior performance in competition with the compared algorithms. In addition, the implementation of KOA on 22 constrained optimization problems from the CEC 2011 test suite, as well as 4 engineering design problems, shows that the proposed approach has acceptable and superior performance compared to competitor algorithms in handling real-world applications.

30 January 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Mohammad DehghaniMohammad Dehghani
Mohammad Dehghani
ZMZeinab Montazeri
Zeinab Montazeri
MDMohammad Dehghani
Mohammad Dehghani
OMOm Malik
Om Malik
Ruben Morales-MenendezRuben Morales-Menendez
Ruben Morales-Menendez
Ricardo A. Ramirez-MendozaRicardo A. Ramirez-Mendoza
Ricardo A. Ramirez-Mendoza
One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke’s law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive.