RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method

被引:815
作者
Ahmadianfar, Iman [1 ]
Heidari, Ali Asghar [2 ,3 ]
Gandomi, Amir H. [4 ]
Chu, Xuefeng [5 ]
Chen, Huiling [6 ]
机构
[1] Behbahan Khatam Alanbia Univ Technol, Dept Civil Engn, Behbahan, Iran
[2] Univ Tehran, Sch Surveying & Geospatial Engn, Coll Engn, Tehran 1439957131, Iran
[3] Natl Univ Singapore, Sch Comp, Dept Comp Sci, Singapore 117417, Singapore
[4] Univ Technol Sydney, Ultimo, NSW 2007, Australia
[5] North Dakota State Univ, Dept Civil & Environm Engn, Dept 2470, Fargo, ND USA
[6] Wenzhou Univ, Coll Comp Sci & Artificial Intelligence, Wenzhou 325035, Zhejiang, Peoples R China
关键词
Genetic algorithms; Evolutionary algorithm; Runge Kutta optimization; Optimization; Swarm intelligence; Performance; NUMERICAL FUNCTION OPTIMIZATION; DIFFERENTIAL EVOLUTION; GLOBAL OPTIMIZATION; DESIGN OPTIMIZATION; SEARCH; STRATEGY; SYSTEMS; SOLVE;
D O I
10.1016/j.eswa.2021.115079
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The optimization field suffers from the metaphor-based "pseudo-novel" or "fancy" optimizers. Most of these cliche ' methods mimic animals' searching trends and possess a small contribution to the optimization process itself. Most of these cliche ' 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 method 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 http://imanahmadianfar.com and http://aliasgharheidari.com/RUN.html.
引用
收藏
页数:22
相关论文
共 90 条
[1]  
Ahmadianfar I., 2020, RENEW ENERG
[2]   Gradient-based optimizer: A new metaheuristic optimization algorithm [J].
Ahmadianfar, Iman ;
Bozorg-Haddad, Omid ;
Chu, Xuefeng .
INFORMATION SCIENCES, 2020, 540 :131-159
[3]   Developing optimal policies for reservoir systems using a multi-strategy optimization algorithm [J].
Ahmadianfar, Iman ;
Khajeh, Zahra ;
Asghari-Pari, Seyed-Amin ;
Chu, Xuefeng .
APPLIED SOFT COMPUTING, 2019, 80 :888-903
[4]   Evolution strategies – A comprehensive introduction [J].
Hans-Georg Beyer ;
Hans-Paul Schwefel .
Natural Computing, 2002, 1 (1) :3-52
[5]   Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization [J].
Baykasoglu, Adil ;
Ozsoydan, Fehmi B. .
INFORMATION SCIENCES, 2017, 420 :159-183
[6]   A Many-Objective Optimization Model of Industrial Internet of Things Based on Private Blockchain [J].
Cao, Bin ;
Wang, Xuesong ;
Zhang, Weizheng ;
Song, Houbing ;
Lv, Zhihan .
IEEE NETWORK, 2020, 34 (05) :78-83
[7]   Quantum-enhanced multiobjective large-scale optimization via parallelism [J].
Cao, Bin ;
Fan, Shanshan ;
Zhao, Jianwei ;
Yang, Po ;
Muhammad, Khan ;
Tanveer, Mohammad .
SWARM AND EVOLUTIONARY COMPUTATION, 2020, 57 (57)
[8]   Multiobjective 3-D Topology Optimization of Next-Generation Wireless Data Center Network [J].
Cao, Bin ;
Zhao, Jianwei ;
Yang, Po ;
Gu, Yu ;
Muhammad, Khan ;
Rodrigues, Joel J. P. C. ;
de Albuquerque, Victor Hugo C. .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (05) :3597-3605
[9]   A balanced whale optimization algorithm for constrained engineering design problems [J].
Chen, Huiling ;
Xu, Yueting ;
Wang, Mingjing ;
Zhao, Xuehua .
APPLIED MATHEMATICAL MODELLING, 2019, 71 :45-59
[10]   Large group activity security risk assessment and risk early warning based on random forest algorithm [J].
Chen, Yanyu ;
Zheng, Wenzhe ;
Li, Wenbo ;
Huang, Yimiao .
PATTERN RECOGNITION LETTERS, 2021, 144 :1-5