RUN beyond Metaphor: An Efficient Optimization Algorithm
Version 1.0.4 (3,14 MB) von
Ali Asghar Heidari
An Efficient Optimization Algorithm Based on Runge Kutta Method
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 https://aliasgharheidari.com/RUN.html
Zitieren als
Ahmadianfar, Iman, et al. “RUN Beyond the Metaphor: An Efficient Optimization Algorithm Based on Runge Kutta Method.” Expert Systems with Applications, Elsevier BV, Apr. 2021, p. 115079, doi:10.1016/j.eswa.2021.115079.
Kompatibilität der MATLAB-Version
Erstellt mit
R2021a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS LinuxTags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Live Editor erkunden
Erstellen Sie Skripte mit Code, Ausgabe und formatiertem Text in einem einzigen ausführbaren Dokument.
Artemisinin Optimizer (AO)-2024
Educational Competition Optimizer (ECO)-2024
Fata Morgana Algorithm (FATA)-2024
Harris Hawk Optimization (HHO)-2019
Hunger Games Search (HGS)-2021
Moss Growth Optimization (MGO)-2024
Parrot Optimizer (PO)-2024
Polar Lights Optimizer (PLO)-2024
Rime Optimization Algorithm (RIME)-2023/RIME Iteration version
Rime Optimization Algorithm (RIME)-2023/RIME function evaluation version
Runge Kutta Optimization (RUN)-2021
Slime mould algorithm (SMA)-2020
Weighted Mean of Vectors (INFO)-2022
Version | Veröffentlicht | Versionshinweise | |
---|---|---|---|
1.0.4 | 2024 |
||
1.0.3 | . |
||
1.0.2 | name matched with paper |
||
1.0.0 |