基于惯性权重对数递减的粒子群优化算法-CEA-计算机工程与应用.PDFVIP

14 2015 ，51（17） Computer Engineering and Applications 计算机工程与应用 基于惯性权重对数递减的粒子群优化算法 戴文智，杨新乐 DAI Wenzhi, YANG Xinle 辽宁工程技术大学 机械工程学院，辽宁 阜新 123000 School of Mechanical Engineering, Liaoning Technical University, Fuxin, Liaoning 123000, China DAI Wenzhi, YANG Xinle. Particle swarm optimization algorithm based on inertia weight logarithmic decreasing. Computer Engineering and Applications, 2015, 51 （17）：14-19. Abstract ：In the light of the problems of slow convergence rate and falling into the local optimization easily for the Particle Swarm Optimization （PSO ）algorithm, the algorithm which based on the inertia weight logarithmic decreasing is pro- posed and the logarithmic adjustment factor is introduced. Changes of logarithmic adjustment factor ensure the success rate. The simulation experiment for eight kinds of typical function in the given number of iterations and precision and the comparison with standard, inertia weight linearly decreasing PSO algorithm and inertia weight decreasing based on Gaussian function are made. The test results show that, the strategy can improve the algorithm ’s global convergence and conver- gence speed easily and efficiently and has a better stability. The better performances can be obtained even without intro- ducing the logarithmic adjustment factor while solving the most optimization problems. Key words ：particle swarm optimization algorithm; inertia weight; logarithmic decreasing; logarithmic adjustment factor 摘 要：针对粒子群算法收敛速度慢和易陷入局部最优的问题，提出了基于惯性权重对数递减的粒子群算法，并引 入对数调整因子，对数调整因子的不同取值保证了算法搜索成功率。选取八种典型函数分别进行给定迭代次数和 给定精度的仿真实验，并与标准PSO 算法、惯性权重线性递减PSO 算法、惯性权重高斯函数递减PSO 算法进行比 较。测试结果表明，该策略可以简便高效地提高算法的全局收敛性和收敛速度，并且具有较好的稳定性。求解大多 数优化问题时，即使不引入对数调整因子新算法就可以获得较好的效果。 关键词：粒子群优化算法；惯性权重；对数递减；对数调整因子 文献标志码：A 中图分类号：TP301.6 doi ：10.3778/j.issn. 1002-8331.1412-0259 1 引言 们的要求也有可能不一样。所以，算法全局搜索能力和 粒子群优化（Particle Swarm