An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges
As the world moves towards industrialization, optimization problems become more
challenging to solve in a reasonable time. More than 500 new metaheuristic algorithms …
challenging to solve in a reasonable time. More than 500 new metaheuristic algorithms …
Recent advances in differential evolution–an updated survey
Differential Evolution (DE) is arguably one of the most powerful and versatile evolutionary
optimizers for the continuous parameter spaces in recent times. Almost 5 years have passed …
optimizers for the continuous parameter spaces in recent times. Almost 5 years have passed …
Sand Cat swarm optimization: A nature-inspired algorithm to solve global optimization problems
A Seyyedabbasi, F Kiani - Engineering with Computers, 2023 - Springer
This study proposes a new metaheuristic algorithm called sand cat swarm optimization
(SCSO) which mimics the sand cat behavior that tries to survive in nature. These cats are …
(SCSO) which mimics the sand cat behavior that tries to survive in nature. These cats are …
Black widow optimization algorithm: a novel meta-heuristic approach for solving engineering optimization problems
V Hayyolalam, AAP Kazem - Engineering Applications of Artificial …, 2020 - Elsevier
Nature-inspired optimization algorithms can solve different engineering and scientific
problems owing to their easiness and flexibility. There is no need for structural modifications …
problems owing to their easiness and flexibility. There is no need for structural modifications …
Bio-inspired computation: Where we stand and what's next
In recent years, the research community has witnessed an explosion of literature dealing
with the mimicking of behavioral patterns and social phenomena observed in nature towards …
with the mimicking of behavioral patterns and social phenomena observed in nature towards …
Improved multi-operator differential evolution algorithm for solving unconstrained problems
KM Sallam, SM Elsayed… - 2020 IEEE congress …, 2020 - ieeexplore.ieee.org
In recent years, several multi-method and multi-operator-based algorithms have been
proposed for solving optimization problems. Generally, their performance is better than other …
proposed for solving optimization problems. Generally, their performance is better than other …
WOASCALF: A new hybrid whale optimization algorithm based on sine cosine algorithm and levy flight to solve global optimization problems
A Seyyedabbasi - Advances in Engineering Software, 2022 - Elsevier
In recent years, researchers have been focused on solving optimization problems in order to
determine the global optimum. Increasing the dimension of a problem increases its …
determine the global optimum. Increasing the dimension of a problem increases its …
AEFA: Artificial electric field algorithm for global optimization
A Yadav - Swarm and Evolutionary Computation, 2019 - Elsevier
Electrostatic Force is one of the fundamental force of physical world. The concept of electric
field and charged particles provide us a strong theory for the working force of attraction or …
field and charged particles provide us a strong theory for the working force of attraction or …
MPSO: Modified particle swarm optimization and its applications
D Tian, Z Shi - Swarm and evolutionary computation, 2018 - Elsevier
Particle swarm optimization (PSO) is a population based meta-heuristic search algorithm
that has been widely applied to a variety of problems since its advent. In PSO, the inertial …
that has been widely applied to a variety of problems since its advent. In PSO, the inertial …
Enhanced Jaya algorithm: A simple but efficient optimization method for constrained engineering design problems
Y Zhang, A Chi, S Mirjalili - Knowledge-Based Systems, 2021 - Elsevier
Jaya algorithm (JAYA) is a new metaheuristic algorithm, which has a very simple structure
and only requires population size and terminal condition for optimization. Given the two …
and only requires population size and terminal condition for optimization. Given the two …