ZMZeinab Montazeri

Zeinab Montazeri

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zeinab Montazeri has a total of 45 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Application of the Orangutan Optimization Algorithm for Solving Vehicle Routing Problems in Sustainable Transportation Systems

    by Anita Susanti, Belal Batiha, Tareq Hamadneh, Gharib Mousa Gharib, Widi Aribowo, Haider Ali, Riyadh Kareem Jawad, Mahmood Anees Ahmed, Ibraheem Kasim Ibraheem, Zeinab Monrazeri, et al.

    Metaheuristic optimization algorithms are powerful tools for solving complex transportation problems. This study investigates the application of the Orangutan Optimization Algorithm (OOA) to a Vehicle Routing Problem (VRP), aiming to minimize travel distances while adhering to time constraints and vehicle capacity limits. Compared to 12 state-of-the-art algorithms, OOA demonstrated superior performance in convergence speed, solution quality, computational efficiency, and robustness. Its dynamic balance between exploration and exploitation allows it to consistently outperform other methods, achieving the best solutions in the least computational time. The study highlights the effectiveness of OOA in solving real-world transportation optimization challenges and sets the stage for future research into hybrid algorithms and integration with emerging technologies such as machine learning and IoT to further advance transportation systems.


  • Open Access

    Actor Optimization Algorithm: A Novel Approach for Engineering Design Challenges

    by Widi Aribowo, Belal Batiha, Tareq Hamadneh, Gharib Mousa Gharib, Hind Monadhel, Riyadh Kareem Jawad, Ibraheem Kasim Ibraheem, Zeinab Monrazeri, Mohammad Dehghani

    In this paper, a novel human-based metaheuristic algorithm called Actor Optimization Algorithm (AOA) is introduced. AOA mimics the behaviors of an actor when playing a role. The main idea in designing AOA is derived from a specific behavior of the actor including (i) simulating the movements and dialogues of the given role and (ii) practicing to better present the assigned role. The theory of AOA is stated and mathematically modeled in the phases of exploration and exploitation. The performance of AOA to address real-world applications is evaluated on the CEC 2011 test suite. The optimization results show that AOA, with its high ability in exploration, exploitation, and balancing during the search process, achieved suitable results. In addition, the performance of AOA was challenged by comparing it with 12 known metaheuristic algorithms. Result comparison showed that the proposed AOA outperformed the competing algorithms by 100% (in all 22 optimization problems) of the CEC 2011 test suite. The simulation results show that AOA has a successful performance in handling optimization tasks in real-world applications by achieving better results in competition with the compared algorithms.


  • Open Access

    A Completely Different and Innovative Bio-Inspired Metaheuristic Approach for Effectively Solving Complex Optimization Problems Across Various Domains

    by Tareq Hamadneh, Belal Batiha, Frank Werner, Kei Eguchi, Zeinab Montazeri, Mohammad Dehghani

    In this paper, a completely different metaheuristic algorithm called the Orangutan Optimization Algorithm (OOA) is introduced, which replicates the complex and adaptive behaviors of Orangutans in their natural habitat. The main inspiration for OOA lies in the strategic foraging techniques of Orangutans, alongside their highly developed nesting abilities. More words are used to provide a detailed theoretical explanation of OOA, followed by a comprehensive modeling of the algorithm’s implementation in two key phases: exploration and exploitation. These phases are mathematically structured to ensure the balance required for optimal search processes. The performance of OOA is rigorously evaluated using twenty-nine benchmark functions from the CEC 2017 test suite, with problem dimensions of 10, 30, 50, and 100. More sentences are included to elaborate on the optimization outcomes, which reveal that OOA effectively balances the exploration and exploitation stages, yielding suitable and competitive solutions across the benchmark functions. Additionally, to further validate its quality, the results from OOA are compared against twelve other well-established metaheuristic algorithms. The analysis of these simulation results demonstrates that OOA consistently outperforms competing algorithms by achieving superior results across most benchmark functions. Furthermore, to assess its real-world applicability, OOA is implemented on a set of twenty-two constrained optimization problems drawn from the CEC 2011 test suite. The extended simulation results clearly indicate that OOA is highly efficient in solving real-world optimization challenges, consistently delivering a superior performance when compared to other competitor algorithms.

  • Top Cited Papers
    Open Access

    Pufferfish Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems

    by Osama Al-Baik, Saleh Alomari, Omar Alssayed, Saikat Gochhait, Irina Leonova, Uma Dutta, Om Parkash Malik, Zeinab Montazeri, 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.


  • Top Cited Papers
    Open Access

    Lyrebird Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems

    by Mohammad Dehghani, Gulnara Bektemyssova, Zeinab Montazeri, Galymzhan Shaikemelev, Om Parkash Malik, 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.


  • Top Cited Papers
    Open Access

    Kookaburra Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems

    by Mohammad Dehghani, Zeinab Montazeri, Gulnara Bektemyssova, Om Parkash Malik, Gaurav Dhiman, Ayman E. 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.


  • Top Cited Papers
    Open Access

    Golf Optimization Algorithm: A New Game-Based Metaheuristic Algorithm and Its Application to Energy Commitment Problem Considering Resilience

    by Zeinab Montazeri, Taher Niknam, Jamshid Aghaei, Om Parkash Malik, Mohammad Dehghani, 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.


  • Open Access

    AMBO: All Members-Based Optimizer for Solving Optimization Problems

    by Fatemeh Ahmadi Zeidabadi, Sajjad Amiri Doumari, Mohammad Dehghani, Zeinab Montazeri

    There are many optimization problems in different branches of science that should be solved using an appropriate methodology. Population-based optimization algorithms are one of the most efficient approaches to solve this type of problems. In this paper, a new optimization algorithm called All Members-Based Optimizer (AMBO) is introduced to solve various optimization problems. The main idea in designing the proposed AMBO algorithm is to use more information from the population members of the algorithm instead of just a few specific members (such as best member and worst member) to update the population matrix. Therefore, in AMBO, any member of the population can play a role in updating the population matrix. The theory of AMBO is described and then mathematically modeled for implementation on optimization problems. The performance of the proposed algorithm is evaluated on a set of twenty-three standard objective functions, which belong to three different categories: unimodal, high-dimensional multimodal, and fixed-dimensional multimodal functions. In order to analyze and compare the optimization results for the mentioned objective functions obtained by AMBO, eight other well-known algorithms have been also implemented. The optimization results demonstrate the ability of AMBO to solve various optimization problems. Also, comparison and analysis of the results show that AMBO is superior and more competitive than the other mentioned algorithms in providing suitable solution.


  • Open Access

    GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems

    by Mohammad Dehghani, Zeinab Montazeri, Štěpán Hubálovský

    There are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to provide appropriate solutions to optimization problems based on a random search of the problem-solving space without the need for gradient and derivative information. In this paper, a new optimization algorithm called the Group Mean-Based Optimizer (GMBO) is presented; it can be applied to solve optimization problems in various fields of science. The main idea in designing the GMBO is to use more effectively the information of different members of the algorithm population based on two selected groups, with the titles of the good group and the bad group. Two new composite members are obtained by averaging each of these groups, which are used to update the population members. The various stages of the GMBO are described and mathematically modeled with the aim of being used to solve optimization problems. The performance of the GMBO in providing a suitable quasi-optimal solution on a set of 23 standard objective functions of different types of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal is evaluated. In addition, the optimization results obtained from the proposed GMBO were compared with eight other widely used optimization algorithms, including the Marine Predators Algorithm (MPA), the Tunicate Swarm Algorithm (TSA), the Whale Optimization Algorithm (WOA), the Grey Wolf Optimizer (GWO), Teaching–Learning-Based Optimization (TLBO), the Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA). The optimization results indicated the acceptable performance of the proposed GMBO, and, based on the analysis and comparison of the results, it was determined that the GMBO is superior and much more competitive than the other eight algorithms.


  • Open Access

    A New “Good and Bad Groups-Based Optimizer” for Solving Various Optimization Problems

    by Ali Sadeghi, Sajjad Amiri Doumari, Mohammad Dehghani, Zeinab Montazeri, Pavel Trojovský, Hamid Jafarabadi Ashtiani

    Optimization is the science that presents a solution among the available solutions considering an optimization problem’s limitations. Optimization algorithms have been introduced as efficient tools for solving optimization problems. These algorithms are designed based on various natural phenomena, behavior, the lifestyle of living beings, physical laws, rules of games, etc. In this paper, a new optimization algorithm called the good and bad groups-based optimizer (GBGBO) is introduced to solve various optimization problems. In GBGBO, population members update under the influence of two groups named the good group and the bad group. The good group consists of a certain number of the population members with better fitness function than other members and the bad group consists of a number of the population members with worse fitness function than other members of the population. GBGBO is mathematically modeled and its performance in solving optimization problems was tested on a set of twenty-three different objective functions. In addition, for further analysis, the results obtained from the proposed algorithm were compared with eight optimization algorithms: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching–learning-based optimization (TLBO), gray wolf optimizer (GWO), and the whale optimization algorithm (WOA), tunicate swarm algorithm (TSA), and marine predators algorithm (MPA). The results show that the proposed GBGBO algorithm has a good ability to solve various optimization problems and is more competitive than other similar algorithms.