Elephant swarm water search algorithm for global optimization
TLDR
A novel elephant swarm water search algorithm inspired by the behaviour of social elephants, to solve different optimization problems, which has been observed that the proposed ESWSA is able to reach nearest to global minima and enabled inference of all true regulations of GRN correctly with less computational time compared with the other existing metaheuristics.Abstract:
The rising complexity of real-life optimization problems has constantly inspired computer researchers to develop new efficient optimization methods. Evolutionary computation and metaheuristics based on swarm intelligence are very popular nature-inspired optimization techniques. In this paper, the author has proposed a novel elephant swarm water search algorithm (ESWSA) inspired by the behaviour of social elephants, to solve different optimization problems. This algorithm is mainly based on the water search strategy of intelligent and social elephants during drought. Initially, we perform preliminary parametric sensitivity analysis for our proposed algorithm, developing guidelines for choosing the parameter values in real-life problems. In addition, the algorithm is evaluated against a number of widely used benchmark functions for global optimizations, and it is observed that the proposed algorithm has better performance for most of the cases compared with other state-of-the-art metaheuristics. Moreover, ESWSA performs better during fitness test, convergence test, computational complexity test, success rate test and scalability test for most of the benchmarks. Next, ESWSA is tested against two well-known constrained optimization problems, where ESWSA is found to be very efficient in term of execution speed and best fitness. As an application of ESWSA to real-life problem, it has been tested against a benchmark problem of computational biology, i.e., inference of Gene Regulatory Network based on Recurrent Neural Network. It has been observed that the proposed ESWSA is able to reach nearest to global minima and enabled inference of all true regulations of GRN correctly with less computational time compared with the other existing metaheuristics.read more
Citations
More filters
Journal ArticleDOI
Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis Recommendations
Daniel Molina,Javier Poyatos,Javier Del Ser,Javier Del Ser,Salvador García,Amir Hussain,Francisco Herrera,Francisco Herrera +7 more
TL;DR: In this paper, the authors present a taxonomy of nature-inspired and bio-inspired algorithms, and provide a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper.
Journal ArticleDOI
Biped robot stability based on an A–C parametric Whale Optimization Algorithm
Mostafa A. Elhosseini,Mostafa A. Elhosseini,Amira Y. Haikal,Mahmoud Mohammed Badawy,Nour Khashan +4 more
TL;DR: A new variant of WOA which focuses on balancing between exploration and exploitation is proposed which targets the A and C parameters of the standard WOA specifically through variation of “a” parameter non-linearly and randomly, as well as updating parameter “C” by applying inertia weight strategy.
Journal ArticleDOI
Metaheuristics: a comprehensive overview and classification along with bibliometric analysis
Absalom E. Ezugwu,Amit K. Shukla,Amit K. Shukla,Rahul Nath,Andronicus Ayobami Akinyelu,Jeffrey O. Agushaka,Haruna Chiroma,Pranab K. Muhuri +7 more
TL;DR: A relatively new taxonomic classification list of both classical and new generation sets of metaheuristic algorithms available in the literature is presented, with the aim of providing an easily accessible collection of popular optimization tools for the global optimization research community who are at the forefront in utilizing these tools for solving complex and difficult real-world problems.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces
Rainer Storn,Kenneth Price +1 more
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Journal ArticleDOI
Ant system: optimization by a colony of cooperating agents
TL;DR: It is shown how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling, and the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.
Journal ArticleDOI
No free lunch theorems for optimization
TL;DR: A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving and a number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.
Journal ArticleDOI
Grey Wolf Optimizer
TL;DR: The results of the classical engineering design problems and real application prove that the proposed GWO algorithm is applicable to challenging problems with unknown search spaces.