一种非线性权重的自适应粒子群优化算法  

Adaptive particle swarm optimization algorithm of nonlinear inertia weight

作　　者：徐刚[1] 杨玉群[2] 黄先玖[1] 

机构地区：[1]南昌大学数学系,南昌330031 [2]南昌大学,南昌330047

出　　处：《计算机工程与应用》2010年第35期49-51,共3页Computer Engineering and Applications

基　　金：江西省自然科学基金(No.2008GZS0076)~~

摘　　要：针对粒子群优化算法中出现早熟和不收敛问题,分析了基本PSO算法参数对其优化性能的影响,提出了基于非线性权重的自适应粒子群优化算法(NWAPSO)。在优化过程中,惯性权重随迭代次数非线性变化,改进的算法能使粒子自适应地改变搜索速度进行搜索,并与基本粒子群算法以及其他改进的粒子群算法进行了比较。实验结果表明,该算法在搜索精度和收敛速度等方面有明显优势。特别对于高维、多峰等复杂非线性优化问题,算法的优越性更明显。Aiming at the prematurity and non-convergence problems in particle swarm optimization algorithmt,he parameters of standard PSO affecting its optimization performance is analysed and an adaptive particle swarm optimization algorithm based on nonlinear inertia weight is pointed out.During optimizationt,he inertia weight changes with nonlinearity along itera-tion timest,he improved algorithm can adaptively change search speed.A compare is made with the standard Particle Swarm Optimization as well as other advanced Particle Swarm Optimization.The experimental results illustrate that the proposed algo-rithm has evident superiorities in search precision and convergence speed.Especiallyt,here are evident superiorities in multi-di-mension and multi-peak nonlinear optimization questions.

关 键 词：粒子群优化算法 非线性 自适应 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]