A self-guided Particle Swarm Optimization with Independent Dynamic Inertia Weights Setting on Each Particle

被引:6
作者
Geng, Huantong [1 ,2 ]
Huang, Yanhong [1 ,2 ]
Gao, Jun [1 ,2 ]
Zhu, Haifeng [1 ,2 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Sch Comp & Software, Nanjing 210044, Jiangsu, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Jiangsu Engn Ctr Network Monitoring, Nanjing 210044, Jiangsu, Peoples R China
来源
APPLIED MATHEMATICS & INFORMATION SCIENCES | 2013年 / 7卷 / 02期
基金
中国博士后科学基金;
关键词
PSO; Linear inertia weight; SgDPSO; Self-guided; Dynamical Inertia Weight;
D O I
10.12785/amis/070217
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the standard PSO algorithm, each particle in swarm has the same inertia weight settings and its values decrease from generation to generation, which can induce the decreasing of population diversity. As a result, it may fall into the local optimum. Besides, the decreasing of weights values is restricted by the maximum evolutionary generation, which has an influence on the convergence speed and search performance. In order to prevent the algorithm from falling into the local optimum early, reduce the influence of the maximum evolutional generation to the decline rate of weights, A Self-guided Particle Swarm Optimization Algorithm with Independent Dynamic Inertia Weights Setting on Each Particle is proposed in the paper. It combines the changes of the evolution speed of each particle with the status information of current swarm. Its core idea is to set the inertia weight and accelerator learning factor dynamically and self-guided by considering the deviation between the objective value of each particle and that of the best particle in swarm and the difference of the objective value of each particle's best position in the two continuous generations. Our method can obtain a balance between the diversity and convergence speed, preventing the premature as well as improving the speed and accurateness. Finally, 30independent experiments are made to demonstrate the performance of our method compared with the standard PSO algorithm based on 9 standard testing benchmark functions. The results show that convergence accurateness of our method is improved by 30% compared with the standard PSO, and there are 4 functions obtaining the optimal value. And convergence accurateness is improved by more than 20% for 5 functions at the same evolution generation.
引用
收藏
页码:545 / 552
页数:8
相关论文
共 18 条
  • [1] Boy R., 1985, CULTURE EVOLUTIONARY
  • [2] Chi Yu-Hong, 2011, Chinese Journal of Computers, V34, P115, DOI 10.3724/SP.J.1016.2011.00115
  • [3] Use of intelligent-particle swarm optimization in electromagnetics
    Ciuprina, G
    Ioan, D
    Munteanu, I
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 2002, 38 (02) : 1037 - 1040
  • [4] Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374
  • [5] Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P94, DOI 10.1109/CEC.2001.934376
  • [6] Fukuyama Y, 2001, IEEE C EVOL COMPUTAT, P87, DOI 10.1109/CEC.2001.934375
  • [7] Hendtlass T., 2001, P INAUGURAL WORKSHOP, P15
  • [8] A Hybri of genetic algorithm and particle swarm optimization for recurrent network design
    Juang, CF
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (02): : 997 - 1006
  • [9] Particle Swarm Optimization - A Survey
    Kameyama, Keisuke
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2009, E92D (07) : 1354 - 1361
  • [10] Kennedy J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1931, DOI 10.1109/CEC.1999.785509