Particle swarm optimization performance improvement using deep learning techniques

被引:27
作者
Pawan, Y. V. R. Naga [1 ]
Prakash, Kolla Bhanu [2 ]
Chowdhury, Subrata [3 ]
Hu, Yu-Chen [4 ]
机构
[1] Anurag Engn Coll, Dept Comp Sci & Engn, Ananthagiri Vm, Telangana, India
[2] Koneru Lakshmaiah Educ Fdn, Dept Comp Sci & Engn, Vaddeswaram, Andhra Pradesh, India
[3] SVCET Engn Coll, Dept Comp Sci & Applicat, Chittoor, Andhra Pradesh, India
[4] Providence Univ, Dept Comp Sci & Informat Management, 200,Sec 7,Taiwan Blvd, Taichung 43301, Taiwan
关键词
Inertia weight; Convolutional neural network; Long short-term memory; Particle swarm optimization;
D O I
10.1007/s11042-022-12966-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Deep learning is widely used to automate processes, improve performance, detect patterns, and solve problems. Thus, applications of deep learning are limitless. Particle swarm optimization is a computational method that optimizes a problem by trying to improve a candidate solution. Although many researchers proposed particle swarm optimization variants, each variant is unique and superior to the existing ones. Among them, inertia weight-based particle swarm optimization has its own identity. By adjusting the inertia weight, the performance of the swarm can be improved. This paper proposes two new particle swarm optimization models using the convolutional neural network and long short-term memory to predict the inertia weight in moving the swarm for improving the swarm performance. The performance of the two new inertia weight models is compared in terms of mean absolute error and standard deviation, with the existing inertia weight based particle swarm optimizations like constant inertia weight, random inertia weight, and linearly decreasing inertia weight particle swarm optimizations. Experiments are conducted with swarm sizes 50, 75, and 100 with dimensions 10, 15, and 25 using the five most commonly used benchmark functions. The results show that the new models have significant performance gain over existing constant, random and linearly decreasing inertia weight particle swarm optimization models.
引用
收藏
页码:27949 / 27968
页数:20
相关论文
共 36 条
  • [1] Amidi Afshine., RECURRENT NEURAL NET
  • [2] Babitha D., 2020, International Journal of Advanced Trends in Computer Science and Engineering, V9, P1767
  • [3] Bansal JC, 2011, P 2011 3 WORLD C NAT, P633, DOI [DOI 10.1109/NABIC.2011.6089659, 10.1109/NaBIC.2011.6089659]
  • [4] Bharadwaj S. S. Y., 2020, INT J ADV TRENDS COM, V9, P1335
  • [5] Impacts of Coefficients on Movement Patterns in the Particle Swarm Optimization Algorithm
    Bonyadi, Mohammad Reza
    Michalewicz, Zbigniew
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (03) : 378 - 390
  • [6] CAO YU, 1995, IROS '95 - 1995 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS: HUMAN ROBOT INTERACTION AND COOPERATIVE ROBOTS, PROCEEDINGS, VOL 1, P226, DOI 10.1109/IROS.1995.525801
  • [7] Engelbrecht A.P., 2007, Computational Intelligence, P289, DOI DOI 10.1002/9780470512517.CH16
  • [8] Particle Swarm Optimisation: A Historical Review Up to the Current Developments
    Freitas, Diogo
    Lopes, Luiz Guerreiro
    Morgado-Dias, Fernando
    [J]. ENTROPY, 2020, 22 (03)
  • [9] Graves A, 2012, STUD COMPUT INTELL, V385, P1, DOI [10.1007/978-3-642-24797-2, 10.1162/neco.1997.9.1.1]
  • [10] On the approximation capability of recurrent neural networks
    Hammer, B
    [J]. NEUROCOMPUTING, 2000, 31 (1-4) : 107 - 123