中文摘要：

针对粒子群优化（PSO）算法容易早熟收敛、在进化后期收敛精度低的缺点,提出了一种基于多策略协同作用的粒子群优化（MSPSO）算法。首先,设定一个概率阈值为0.3,在粒子迭代过程中,如果随机生成的概率值小于阈值,则采用对当前种群中的最优个体进行反向学习并生成其反向解,以提高算法的收敛速度和收敛精度;否则,算法执行对粒子的位置进行高斯变异策略,以增强种群的多样性;其次,提出一种将柯西分布的比例参数进行线性递减的柯西变异策略,能够产生更好的解引导粒子向最优解空间运动;最后,在8个标准测试函数上进行仿真测试,MSPSO算法在Rosenbrock、Schwefel’s P2.22、Rotated Ackley、Quadric Noise、Ackley函数上收敛的平均值分别为1.68E＋01、2.36E-283、8.88E-16、2.78E-05、8.88E-16,在Sphere、Griewank和Rastrigin函数上收敛达到最优解0,优于高斯扰动粒子群优化（GDPSO）算法、基于柯西变异的反向学习粒子群优化（GOPSO）算法。结果表明,所提出的算法收敛精度高,能避免粒子陷入局部最优。

英文摘要：

Aiming at the shortage that Particle Swarm Optimization（ PSO） algorithm is easy to fall into local optima and has low precision at later evolution process,a modified Multi-Strategies synergy PSO（ MSPSO） algorithm was proposed.Firstly,a probability threshold value of 0. 3 was set. In every iteration,if the randomly generated probability value was less than the threshold,the algorithm with opposition-based learning for the best individual was adopted to generate their opposite solutions,which improved the convergence speed and precision of PSO; otherwise,Gaussian mutation strategy was adopted for the particle position to enhance the diversity of population. Secondly,a Cauchy mutation strategy for linearly decreasing cauchy distribution scale parameter decreased was proposed,to generate better solution to guide the particle to approximate the optimum space. Finally,the simulation experiments were conducted on eight benchmark functions. MSPSO algorithm has the convergence mean value of 1. 68 E ＋ 01,2. 36E- 283,8. 88E- 16,2. 78E- 05,8. 88E- 16,respectively in Rosenbrock,Schwefel＇s P2. 22,Rotated Ackley,Quadric Noise and Ackley,and can converge to the optimal solution of 0 in Sphere,Griewank and Rastrigin,which is better than GDPSO（ PSO based on Gaussian Disturbance） and GOPSO（ PSO based on global best Cauchy mutation and Opposition-based learning）. The results show that proposed algorithm has higher convergence accuracy and can effectively avoid being trapped in local optimal solution.