Firefly Algorithm with Deep Learning

被引:0
|
作者
Zhao J. [1 ,2 ,3 ]
Xie Z.-F. [1 ]
Lü L. [1 ,2 ,3 ]
Wang H. [1 ,2 ,3 ]
Sun H. [1 ,2 ,3 ]
Yu X. [1 ,3 ]
机构
[1] School of Information Engineering, Nanchang Institute of Technology, Nanchang, 330099, Jiangxi
[2] National-Local Engineering Laboratory of Water Engineering Safety and Effective Utilization of Resources in Poyang Lake Area, Nanchang, 330099, Jiangxi
[3] Jiangxi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing, Nanchang, 330099, Jiangxi
来源
| 2018年 / Chinese Institute of Electronics卷 / 46期
关键词
Deep learning; Firefly algorithm; General center particle; Global optimization; Random attraction model;
D O I
10.3969/j.issn.0372-2112.2018.11.010
中图分类号
学科分类号
摘要
In order to overcome low precision and premature convergence of firefly algorithm, this paper proposes a new method, called firefly algorithm with deep learning. First, firefly algorithm selects a particle to learn according to the random attraction model; second, the method constructs a general center particle based on the best historical position; third, the particle leads the evolution of the population after a certain times of one-dimensional deep learning. Experiments show that the deep learning strategy and the number of deep learning of particles play an important role in optimizing the performance of the algorithm. The experimental results of 12 benchmark functions demonstrate that the comprehensive optimization performance of the proposed algorithm outperforms eight other recently firefly algorithm variants. © 2018, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码:2633 / 2641
页数:8
相关论文
共 27 条
  • [1] Masmoudi A., Chaoui S., Masmoudi A., A finite mixture model of geometric distributions for lossless image compression, Signal Image & Video Processing, 10, 4, pp. 671-678, (2016)
  • [2] Arvalo R., Garca J., Guijarro F., Et al., A dynamic trading rule based on filtered flag pattern recognition for stock market price forecasting, Expert Systems with Applications, 81, pp. 177-192, (2017)
  • [3] Lee H.M., Yoo D.G., Sadollah A., Et al., Optimal cost design of water distribution networks using a decomposition approach, Engineering Optimization, 48, 12, pp. 2141-2156, (2016)
  • [4] Mashayekhy L., Nejad M.M., Grosu D., Et al., An online mechanism for resource allocation and pricing in clouds, IEEE Transactions on Computers, 65, 4, pp. 1172-1184, (2016)
  • [5] Yeh W.C., A novel node-based sequential implicit enumeration method for finding all d-MPs in a multistate flow network, Information Sciences, 297, pp. 283-292, (2015)
  • [6] Bhati D., Singh P., Branch and bound computational method for multi-objective linear fractional optimization problem, Neural Computing and Applications, 28, 11, pp. 3341-3351, (2017)
  • [7] Mathieu L., Olivier P., Dynamic programm-ing for mean-field type control, Journal of Optimization Theory & Applications, 169, 3, pp. 902-924, (2016)
  • [8] Kennedy J., Eberhart R., Particle swarm optimization, Proceedings of International Conference on Neural Networks, pp. 1942-1948, (1995)
  • [9] Chen K.-S., Ruan Y.-L., Dai L., Et al., Regional-segmentation self-adapting variation particle swarm optimization, Acta Electronica Sinica, 45, 8, pp. 1849-1855, (2017)
  • [10] Zhou L.-Y., Ding L.-X., Peng H., Et al., Neighborhood centroid opposition-based particle swarm optimization, Acta Electronica Sinica, 45, 11, pp. 2815-2824, (2017)