Multiple scale self-adaptive cooperation mutation strategy-based particle swarm optimization

被引:24
|
作者
Tao, Xinmin [1 ]
Guo, Wenjie [1 ]
Li, Qing [1 ]
Ren, Chao [1 ]
Liu, Rui [1 ]
机构
[1] Northeast Forestry Univ, Coll Engn & Technol, 26 Hexing Rd, Harbin 150040, Heilongjiang, Peoples R China
关键词
Particle swarm optimization; Premature convergence; Multi-scale Gaussian mutations; Uniform mutation; Self-adaptive mutation threshold; NEURAL-NETWORK; ALGORITHM;
D O I
10.1016/j.asoc.2020.106124
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Particle Swarm Optimization (PSO) algorithm has lately received great attention due to its powerful search capacity and simplicity in implementation. However, previous studies have demonstrated that PSO still suffers from two key drawbacks of premature convergence and slow convergence, especially when dealing with multi-modal optimization problems. In order to address these two issues, we propose a multiple scale self-adaptive cooperative mutation strategy-based particle swarm optimization algorithm (MSCPSO) in this paper. In the proposed approach, we adopt multi-scale Gaussian mutations with different standard deviations to promote the capacity of sufficiently searching the whole solution space. In the adopted multi-scale mutation strategy, large-scale mutation can make populations explore the global solution space and rapidly locate the better solution area at the early stage, thus avoiding the premature convergence and simultaneously speeding up the convergence, while small-scale mutation can allow the populations to more accurately exploit the local best solution area during the later stage, thus improving the accuracy of final solution. In order to guarantee the convergence speed while avoiding premature convergence, the standard deviations for multi-scale Gaussian mutations would be reduced with the increase of iterations, which can make populations pay more attention to local accurate solution exploitation during the later evolution stage and consequently speed up the convergence. In addition, the threshold for each dimension to execute mutation is also dynamically adjusted according to its previous mutation frequency, which can allow MSCPSO to better balance the global and local search capacities, thus avoiding premature convergence without reducing convergence speed. The extensive experimental results on various benchmark optimization problems demonstrate that the proposed approach is superior to other existing PSO techniques with good robustness. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:18
相关论文
共 50 条
  • [41] A self-adaptive particle swarm optimization algorithm with individual coefficients adjustment
    Wu, Zhengjia
    Zhou, Jianzhong
    [J]. CIS: 2007 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PROCEEDINGS, 2007, : 133 - +
  • [42] Convergence Analysis of Self-adaptive Immune Particle Swarm Optimization Algorithm
    Jiang, Jingqing
    Song, Chuyi
    Ping, Huan
    Zhang, Chenggang
    [J]. ADVANCES IN NEURAL NETWORKS - ISNN 2018, 2018, 10878 : 157 - 164
  • [43] Particle Swarm Optimization with Adaptive Mutation
    Tang, Jun
    Zhao, Xiaojuan
    [J]. 2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 234 - 237
  • [44] Adaptive Particle Swarm Optimization with Mutation
    Xu Dong
    Li Ye
    Tang Xudong
    Pang Yongjie
    Liao Yulei
    [J]. 2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 2044 - 2049
  • [45] An integrated particle swarm optimization approach hybridizing a new self-adaptive particle swarm optimization with a modified differential evolution
    Tang, Biwei
    Xiang, Kui
    Pang, Muye
    [J]. NEURAL COMPUTING & APPLICATIONS, 2020, 32 (09): : 4849 - 4883
  • [46] An integrated particle swarm optimization approach hybridizing a new self-adaptive particle swarm optimization with a modified differential evolution
    Biwei Tang
    Kui Xiang
    Muye Pang
    [J]. Neural Computing and Applications, 2020, 32 : 4849 - 4883
  • [47] Comparison of Self-Adaptive Particle Swarm Optimizers
    van Zyl, E. T.
    Engelbrecht, A. P.
    [J]. 2014 IEEE SYMPOSIUM ON SWARM INTELLIGENCE (SIS), 2014, : 48 - 56
  • [48] A Self-adaptive Dynamic Particle Swarm Optimizer
    Liang, J. J.
    Guo, L.
    Liu, R.
    Qu, B. Y.
    [J]. 2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 3206 - 3213
  • [49] Reactive Power Dispatch Based on Self-Adaptive Differential Evolution Hybrid Particle Swarm Optimization
    Wang, C.
    Liu, Y. C.
    Guo, H. H.
    Chen, Y.
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL APPLICATIONS (CISIA 2015), 2015, 18 : 75 - 78
  • [50] Self-adaptive potential-based stopping criteria for Particle Swarm Optimization with forced moves
    Bernd Bassimir
    Manuel Schmitt
    Rolf Wanka
    [J]. Swarm Intelligence, 2020, 14 : 285 - 311