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

被引:588
作者
Ahmadianfar, Iman [1 ]
Heidari, Ali Asghar [2 ]
Noshadian, Saeed [1 ]
Chen, Huiling [3 ]
Gandomi, Amir H. [4 ]
机构
[1] Behbahan Khatam Alanbia Univ Technol, Dept Civil Engn, Behbahan, Iran
[2] Univ Tehran, Coll Engn, Sch Surveying & Geospatial Engn, Tehran 1439957131, Iran
[3] Wenzhou Univ, Coll Comp Sci & Artificial Intelligence, Wenzhou 325035, Zhejiang, Peoples R China
[4] Univ Technol Sydney, Fac Engn & Informat Technol, Sydney, NSW 2007, Australia
基金
中国国家自然科学基金;
关键词
Swarm intelligence; INFO; INFO optimization algorithm; Weighted mean of vectors; Algorithm; Benchmark; Metaheuristic; Genetic algorithm; Artificial intelligence; Global optimization; PARTICLE SWARM OPTIMIZATION; SIMULATED ANNEALING ALGORITHM; GRADIENT-BASED OPTIMIZER; DIFFERENTIAL EVOLUTION; SEARCH ALGORITHM; GLOBAL OPTIMIZATION; SYSTEM; COLONY;
D O I
10.1016/j.eswa.2022.116516
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This study presents the analysis and principle of an innovative optimizer named weIghted meaN oF vectOrs (INFO) to optimize different problems. INFO is a modified weight mean method, whereby the weighted mean idea is employed for a solid structure and updating the vectors' position using three core procedures: updating rule, vector combining, and a local search. The updating rule stage is based on a mean-based law and convergence acceleration to generate new vectors. The vector combining stage creates a combination of obtained vectors with the updating rule to achieve a promising solution. The updating rule and vector combining steps were improved in INFO to increase the exploration and exploitation capacities. Moreover, the local search stage helps this algorithm escape low-accuracy solutions and improve exploitation and convergence. The performance of INFO was evaluated in 48 mathematical test functions, and five constrained engineering test cases including optimal design of 10-reservoir system and 4-reservoir system. According to the literature, the results demonstrate that INFO outperforms other basic and advanced methods in terms of exploration and exploitation. In the case of engineering problems, the results indicate that the INFO can converge to 0.99% of the global optimum solution. Hence, the INFO algorithm is a promising tool for optimal designs in optimization problems, which stems from the considerable efficiency of this algorithm for optimizing constrained cases. The source codes of INFO algorithm are publicly available at https://imanahmadianfar.com. and https://aliasgharheidari.com/INFO.html.
引用
收藏
页数:26
相关论文
共 100 条
[81]  
Paterlini S., HIGH PERFORMANCE CLU, V2
[82]   GSA: A Gravitational Search Algorithm [J].
Rashedi, Esmat ;
Nezamabadi-Pour, Hossein ;
Saryazdi, Saeid .
INFORMATION SCIENCES, 2009, 179 (13) :2232-2248
[83]   Mine blast algorithm: A new population based algorithm for solving constrained engineering optimization problems [J].
Sadollah, Ali ;
Bahreininejad, Ardeshir ;
Eskandar, Hadi ;
Hamdi, Mohd .
APPLIED SOFT COMPUTING, 2013, 13 (05) :2592-2612
[84]   Metaheuristics in structural optimization and discussions on harmony search algorithm [J].
Saka, M. P. ;
Hasancebi, O. ;
Geem, Z. W. .
SWARM AND EVOLUTIONARY COMPUTATION, 2016, 28 :88-97
[85]  
Samadi-koucheksaraee A., 2018, WATER RESOUR MANAG
[86]   Simulated Annealing, Its Variants and Engineering Applications [J].
Siddique, Nazmul ;
Adeli, Hojjat .
INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2016, 25 (06)
[87]  
Storn R, 1995, TECH REP INT COMPUT, V11
[88]   Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems [J].
Sun, Chaoli ;
Jin, Yaochu ;
Cheng, Ran ;
Ding, Jinliang ;
Zeng, Jianchao .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (04) :644-660
[89]  
Talbi E-G., 2009, Metaheuristics: From design to implementation, DOI [10.1002/9780470496916, DOI 10.1002/9780470496916]
[90]   Nature inspired optimization algorithms or simply variations of metaheuristics? [J].
Tzanetos, Alexandros ;
Dounias, Georgios .
ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (03) :1841-1862