A Multi-strategy Improved Fireworks Optimization Algorithm

被引:0
作者
Zou, Pengcheng [1 ]
Huang, Huajuan [2 ]
Wei, Xiuxi [2 ]
机构
[1] Guangxi Minzu Univ, Coll Elect Informat, Nanning 530000, Peoples R China
[2] Guangxi Minzu Univ, Coll Artificial Intelligence, Nanning 530000, Peoples R China
来源
INTELLIGENT COMPUTING THEORIES AND APPLICATION (ICIC 2022), PT I | 2022年 / 13393卷
基金
中国国家自然科学基金;
关键词
Fireworks algorithm; Multi-strategy; Self-adaptation; Dynamic selection; Engineering constrained optimization problem;
D O I
10.1007/978-3-031-13870-6_8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
To solve the shortcomings of traditional Fireworks Algorithm (FWA), such as slow convergence, being easy to fall into local optimum and low precision, a multi-operator improved Multi-strategy Fireworks Algorithm (MSFWA) was proposed. For initialization, the position of individual fireworks is initialized by chaos. As for the explosion operator, the explosion range is reduced nonlinearly and the explosion range of each fireworks particle is divided according to the level of fitness. It is beneficial to improve the development and exploration of the algorithm. For mutation operator, this paper adds mutation information on the basis of retaining the original information, and adopts adaptive strategy to select different mutation modes to further improve the ability to jump out of local optimum. For the selection operator, a brand-new strategy of multi-elite reservation + random / elite reservation is adopted, improving the global and local searching ability of the algorithm. Combining various strategies improves the global and local searching ability of the algorithm, and accelerates the convergence speed. Finally, 8 benchmark test functions and optimization problems of Design of Reducer are tested. The experimental results show that MSFWA has better optimization accuracy and performance than FWA and other heuristic intelligent algorithms.
引用
收藏
页码:97 / 111
页数:15
相关论文
共 18 条
[1]   Artificial bee colony algorithm for large-scale problems and engineering design optimization [J].
Akay, Bahriye ;
Karaboga, Dervis .
JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (04) :1001-1014
[2]   Butterfly optimization algorithm: a novel approach for global optimization [J].
Arora, Sankalap ;
Singh, Satvir .
SOFT COMPUTING, 2019, 23 (03) :715-734
[3]   Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems [J].
Gandomi, Amir Hossein ;
Yang, Xin-She ;
Alavi, Amir Hossein .
ENGINEERING WITH COMPUTERS, 2013, 29 (01) :17-35
[4]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[5]   Loser-Out Tournament-Based Fireworks Algorithm for Multimodal Function Optimization [J].
Li, Junzhi ;
Tan, Ying .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (05) :679-691
[6]   The Effect of Information Utilization: Introducing a Novel Guiding Spark in the Fireworks Algorithm [J].
Li, Junzhi ;
Zheng, Shaoqiu ;
Tan, Ying .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (01) :153-166
[7]  
Li JZ, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P3214, DOI 10.1109/CEC.2014.6900418
[8]   The Whale Optimization Algorithm [J].
Mirjalili, Seyedali ;
Lewis, Andrew .
ADVANCES IN ENGINEERING SOFTWARE, 2016, 95 :51-67
[9]   A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example [J].
Pan, Wen-Tsao .
KNOWLEDGE-BASED SYSTEMS, 2012, 26 :69-74
[10]  
[苏守宝 Su Shoubao], 2020, [重庆大学学报, Journal of Chongqing University], V43, P84