一种动态改变惯性权重的自适应粒子群算法  

Adaptive particle swarm optimization algorithm with dynamically changing inertia weight

作　　者：张顶学[1] 关治洪[2] 刘新芝[2] 

机构地区：[1]长江大学石油工程学院,湖北荆州434203 [2]华中科技大学控制科学与工程系,武汉430074

出　　处：《控制与决策》2008年第11期1253-1257,共5页Control and Decision

基　　金：国家自然科学基金项目(60573005;60603006);湖北省高等学校优秀中青年团队计划项目(T200803)

摘　　要：针对标准粒子群算法在进化过程中种群多样性降低而早熟的问题,提出一种动态改变惯性权重的自适应粒子群算法.采用种群中平均粒子相似程度作为种群多样性的测度,并用于平衡算法的全局探索和局部开发.基于对惯性权重随种群多样性测度变化的动态分析,建立了惯性权重随种群多样性测度的变化关系,并将其引入该算法中.最后对6个经典测试函数进行仿真,结果表明该算法在平均最优值和成功率上都有所提高,特别是对多峰函数效果更明显.To overcome the premature caused by standard particle swarm optimization （PSO） algorithm searching for the large lost in population diversity, an adaptive PSO with dynamically changing inertia weight is proposed. The average of similarity of particles in the population as the measure of population diversity is introduced into proposed algorithm to balance the trade-off between exploration and exploitation. A function relationship between inertia weight and the measure of population diversity is established by analyzing the dynamically relationship between them, which is embedded into the algorithm. The simulation results show that the algorithm has better probability of finding global optimum and mean best value, especially for multimodal function.

关 键 词：粒子群算法 惯性权重 自适应 种群多样性 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]