Mixed Particle Swarm Optimization Algorithm with Multistage Disturbances

被引：0
|
作者：
Xu L.-F. [1 ]
Huang Z.-S. [1 ]
Yang Z.-Z. [1 ]
Ding W.-L. [1 ]
机构：
[1] School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou
来源：
Ruan Jian Xue Bao/Journal of Software | 2019年 / 30卷 / 06期
基金：
中国国家自然科学基金;
关键词：
Ergodic ability; Locally optimum; Mixed; Multistage disturbances; Particle swarm optimization algorithm;
D O I：
10.13328/j.cnki.jos.005600
中图分类号：
学科分类号：
摘要：
To avoid the locally optimum which is frequently be the result of a calculation of particle swarm optimization (PSO) algorithm, it is proposed in this study a new mixed PSO algorithm with multistage disturbance (MPSO). MPSO combined features from two former classic improved PSO algorithms, which are standard particle swarm optimization (SPSO) and standard particle swarm optimization with a constriction factor (PSOCF). Furthermore, a strategy with multistage disturbances was also introduced into the algorithm: The first-level disturbance was used to enhance the ability of the particles to traverse the solution space when renewing the positions, while the second-level disturbance would be introduced when locally optimal solution was received to continue the optimization process. Six test functions, namely the Sphere, Ackley, Rastrigin, Styblinski-Tang, Duadric, and Rosenbrock functions, were used to simulate the optimization calculation, and the results from proposed algorithm MPSO were compared with those from SPSO and PSOCF. The results show that for the test functions, MPSO can get the optimal value much more quickly and easily than the other two algorithms, and the convergence precision of MPSO was significantly higher than the others. It can be concluded that MPSO can get over the problem of locally optimal solution when dealing with multimodal functions. © Copyright 2019, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：1835 / 1852
页数：17
相关论文
共 33 条
  • [1] Kennedy J., Eberhart R.C., Particle swarm optimization, Proc. of the IEEE Int'l Conf. on Neural Networks, pp. 1942-1948, (1995)
  • [2] Shi Y., Eberhart R.C., A modified particle swarm optimizer, Proc. of the IEEE Int'l Conf. on Evolutionary Computation, pp. 69-73, (1998)
  • [3] Clerc M., Kennedy J., The particle swarm: Explosion, stability, and convergence in a multidimensional complex space, IEEE Trans. on Evolutionary Computation, 6, pp. 58-73, (2002)
  • [4] Liu L.J., Cai Z.X., Particle swarm optimization algorithms based on CLONAL, Mini-micro Systems, 27, 9, pp. 1708-1710, (2006)
  • [5] Li L., Wang W.L., Xu X.L., Li W.K., Multi-objective particle swarm optimization based on grid ranking, Journal of Computer Research and Development, 54, 5, pp. 1012-1023, (2017)
  • [6] Hu W., Yen G.G., Zhang X., Multi-objective particle swarm optimization based on Pareto entropy, Ruan Jian Xue Bao/Journal of Software, 25, 5, pp. 1025-1050, (2014)
  • [7] Ratnaweera A., Halgamuge S.K., Watson H.C., Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients, IEEE Trans. on Evolutionary Computation, 8, 3, pp. 240-255, (2004)
  • [8] Zhang Y.M., Jiang S.J., Chen R.Y., Wang X.Y., Zhang M., Class integration testing order determination method based on particle swarm optimization algorithm, Chinese Journal of Computers, 41, 4, pp. 931-945, (2016)
  • [9] Cheng J., Modification and application of particle swarm optimization algorithm based on biological behavior mechanism, (2014)
  • [10] Li B.Y., Xiao Y.S., Wu Q.D., Hybird algorithm based on particle swarm optimization for solving constrained optimization problems, Control and Decision, 19, 7, pp. 804-807, (2004)
1234