Efficient hybrid algorithm based on moth search and fireworks algorithm for solving numerical and constrained engineering optimization problems

被引:25
作者
Han, Xiaoxia [1 ]
Yue, Lin [1 ]
Dong, Yingchao [1 ]
Xu, Quanxi [1 ]
Xie, Gang [1 ,2 ]
Xu, Xinying [1 ]
机构
[1] Taiyuan Univ Technol, Dept Automat, Coll Elect & Power Engn, 79 Yingze West St, Taiyuan 030024, Shanxi, Peoples R China
[2] Taiyuan Univ Sci & Technol, Sch Elect & Informat Engn, Taiyuan 030024, Shanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Constrained engineering optimization problem; Moth search-fireworks algorithm; Exploitation; Exploration; Explosion and mutation operators; DISCRETE-CONTINUOUS OPTIMIZATION; PARTICLE SWARM OPTIMIZATION; STRUCTURAL OPTIMIZATION; DIFFERENTIAL EVOLUTION; DESIGN; PERFORMANCE; INTEGER;
D O I
10.1007/s11227-020-03212-2
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The moth search algorithm (MS) is a novel intelligent optimization algorithm based on moth population behavior, which can solve many problems in different fields. However, the algorithm is easy to fall into local optimization when solving complex optimization problems. This study develops a new hybrid moth search-fireworks algorithm (MSFWA) to solve numerical and constrained engineering optimization problems. The explosion and mutation operators from the fireworks algorithm are introduced into the MS, which not only preserves the advantages of fast convergence and strong exploitation capability of the algorithm, but also significantly enhances the exploration capability. The performance of the MSFWA is tested using 23 benchmark functions. The hybrid algorithm is superior to other highly advanced metaheuristic algorithms for most benchmark functions, demonstrating the characteristics of fast convergence and high stability. Finally, the ability of the MSFWA to solve practical constrained problems is evaluated on six well-known engineering application problems. Compared with other optimization algorithms, the MSFWA is very competitive in its solution of these complex and constrained practical problems.
引用
收藏
页码:9404 / 9429
页数:26
相关论文
共 53 条
[1]   A novel hybrid Cultural Algorithms framework with trajectory-based search for global numerical optimization [J].
Ali, Mostafa Z. ;
Awad, Noor H. ;
Suganthan, Ponnuthurai N. ;
Duwairi, Rehab M. ;
Reynolds, Robert G. .
INFORMATION SCIENCES, 2016, 334 :219-249
[2]   A STUDY OF MATHEMATICAL-PROGRAMMING METHODS FOR STRUCTURAL OPTIMIZATION .1. THEORY [J].
BELEGUNDU, AD ;
ARORA, JS .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1985, 21 (09) :1583-1599
[3]   PSOSCALF: A new hybrid PSO based on Sine Cosine Algorithm and Levy flight for solving optimization problems [J].
Chegini, Saeed Nezamivand ;
Bagheri, Ahmad ;
Najafi, Farid .
APPLIED SOFT COMPUTING, 2018, 73 :697-726
[4]   PS-FW: A Hybrid Algorithm Based on Particle Swarm and Fireworks for Global Optimization [J].
Chen, Shuangqing ;
Liu, Yang ;
Wei, Lixin ;
Guan, Bing .
COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2018, 2018
[5]   Symbiotic Organisms Search: A new metaheuristic optimization algorithm [J].
Cheng, Min-Yuan ;
Prayogo, Doddy .
COMPUTERS & STRUCTURES, 2014, 139 :98-112
[6]  
Chickermane H, 1996, INT J NUMER METH ENG, V39, P829, DOI 10.1002/(SICI)1097-0207(19960315)39:5<829::AID-NME884>3.0.CO
[7]  
2-U
[8]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[9]   Use of a self-adaptive penalty approach for engineering optimization problems [J].
Coello, CAC .
COMPUTERS IN INDUSTRY, 2000, 41 (02) :113-127
[10]  
Coit W. David, 1998, Eng. Econ., V43, P379, DOI DOI 10.1080/00137919808903206