Enhanced Moth-flame Optimization Based on Cultural Learning and Gaussian Mutation

被引:0
作者
Liwu Xu
Yuanzheng Li
Kaicheng Li
Gooi Hoay Beng
Zhiqiang Jiang
Chao Wang
Nian Liu
机构
[1] Huazhong University of Science and Technology,State Key Laboratory of Advanced Electromagnetic Engineering and Technology, School of Electrical Engineering and Electronics
[2] Huazhong University of Science and Technology,School of Automation, Ministry of Education Key Laboratory of Image Processing and Intelligence Control
[3] Nanyang Technological University,School of Hydropower and Information Engineering
[4] Huazhong University of Science and Technology,State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources
[5] China Institute of Water Resources and Hydropower Research,undefined
[6] North China Electric Power University,undefined
来源
Journal of Bionic Engineering | 2018年 / 15卷
关键词
bioinspired computing; moth-flame optimization; cultural learning; Gaussian mutation; benchmark functions;
D O I
暂无
中图分类号
学科分类号
摘要
This paper presents an Enhanced Moth-Flame Optimization (EMFO) technique based on Cultural Learning (CL) and Gaussian Mutation (GM). The mechanism of CL and the operator of GM are incorporated to the original algorithm of Moth-Flame Optimization (MFO). CL plays an important role in the inheritance of historical experiences and stimulates moths to obtain information from flames more effectively, which helps MFO enhance its searching ability. Furthermore, in order to overcome the disadvantage of trapping into local optima, the operator of GM is introduced to MFO. This operator acts on the best flame in order to generate several variant ones, which can increase the diversity. The proposed algorithm of EMFO has been comprehensively evaluated on 13 benchmark functions, in comparison with MFO. Simulation results verify that EMFO shows a significant improvement on MFO, in terms of solution quality and algorithmic reliability.
引用
收藏
页码:751 / 763
页数:12
相关论文
共 68 条
[1]  
Tao F(2014)Concept, principle and application of dynamic configuration for intelligent algorithms IEEE Systems Journal 8 28-42
[2]  
Laili Y(2000)The simple genetic algorithm: Foundations and theory IEEE Transactions on Evolutionary Computation 4 191-192
[3]  
Liu Y(2002)The particle swarm: Explosion, stability, and convergence in a multi-dimensional complex space IEEE Transactions on Evolutionary Computation 6 58-73
[4]  
Feng Y(2006)Ant colony optimization - Artificial ants as a computational intelligence technique IEEE Computational Intelligence Magazine 1 28-39
[5]  
Wang Q(2009)A comparative study of artificial bee colony algorithm Applied Mathematics and Computation 214 108-132
[6]  
Zhang L(2012)A new fruit fly optimization algorithm: Taking the financial distress model as an example Knowledge-Based Systems 26 69-74
[7]  
Xu L(2011)Cuckoo optimization algorithm Applied Soft Computing 11 5508-5518
[8]  
Beyer H G(2009)Group search optimizer: An optimization algorithm inspired by animal searching behavior IEEE Transactions on Evolutionary Computation 13 973-990
[9]  
Clerc M(2015)Group search optimizer with intraspecific competition and levy walk Knowledge-Based Systems 73 44-51
[10]  
Kennedy J(2015)The ant lion optimizer Advances in Engineering Software 83 80-98