RUN Beyond the Metaphor: An Efficient Optimization Algorithm Based on Runge Kutta Method

05/07/2021
by   Ali Asghar Heidari, et al.
0

The optimization field suffers from the metaphor-based “pseudo-novel” or “fancy” optimizers. Most of these cliché methods mimic animals' searching trends and possess a small contribution to the optimization process itself. Most of these cliché methods suffer from the locally efficient performance, biased verification methods on easy problems, and high similarity between their components' interactions. This study attempts to go beyond the traps of metaphors and introduce a novel metaphor-free population-based optimization based on the mathematical foundations and ideas of the Runge Kutta (RK) method widely well-known in mathematics. The proposed RUNge Kutta optimizer (RUN) was developed to deal with various types of optimization problems in the future. The RUN utilizes the logic of slope variations computed by the RK method as a promising and logical searching mechanism for global optimization. This search mechanism benefits from two active exploration and exploitation phases for exploring the promising regions in the feature space and constructive movement toward the global best solution. Furthermore, an enhanced solution quality (ESQ) mechanism is employed to avoid the local optimal solutions and increase convergence speed. The RUN algorithm's efficiency was evaluated by comparing with other metaheuristic algorithms in 50 mathematical test functions and four real-world engineering problems. The RUN provided very promising and competitive results, showing superior exploration and exploitation tendencies, fast convergence rate, and local optima avoidance. In optimizing the constrained engineering problems, the metaphor-free RUN demonstrated its suitable performance as well. The authors invite the community for extensive evaluations of this deep-rooted optimizer as a promising tool for real-world optimization. The source codes, supplementary materials, and guidance for the developed method will be publicly available at different hubs at and http://imanahmadianfar.com and http://aliasgharheidari.com/RUN.html.

READ FULL TEXT

page 23

page 30

page 33

page 35

research
01/18/2022

INFO: An efficient optimization algorithm based on weighted mean of vectors

This study presents the analysis and principle of an innovative optimize...
research
11/20/2020

Rationalized Fruit Fly Optimization with Sine Cosine Algorithm: A Comprehensive Analysis

The fruit fly optimization algorithm (FOA) is a well-regarded algorithm ...
research
11/01/2020

Slime mould algorithm: A new method for stochastic optimization

In this paper, a new stochastic optimizer, which is called slime mould a...
research
11/20/2020

Exploratory Differential Ant Lion-based Optimization

In this work, an improved alternative method of the ant lion optimizer (...
research
11/20/2020

Opposition-based Learning Harris Hawks Optimization with Advanced Transition Rules: Principles and Analysis

Harris hawks optimizer (HHO) is a recently developed, efficient meta-heu...
research
10/28/2020

Harris Hawks Optimization: Algorithm and Applications

In this paper, a novel population-based, nature-inspired optimization pa...
research
11/20/2020

An enhanced associative learning-based exploratory whale optimizer for global optimization

Whale optimization algorithm (WOA) is a recent nature-inspired metaheuri...

Please sign up or login with your details

Forgot password? Click here to reset