首页 | 官方网站   微博 | 高级检索  
     

一种邻居动态调整的粒子群优化算法
引用本文:陈自郁,何中市,张程.一种邻居动态调整的粒子群优化算法[J].模式识别与人工智能,2010,23(4):586-590.
作者姓名:陈自郁  何中市  张程
作者单位:重庆大学 计算机学院 重庆 400044
基金项目:国家科技重大专项项目,国家863计划项目,中央高校基本科研业务费专项项目
摘    要:为了达到全局寻优能力与寻优速度的平衡,提出一种邻居动态调整的粒子群优化算法。该算法依据粒子的多样性变化和进化状态,实现邻居结构的动态改变。算法引入种群熵评估粒子的多样性,定义粒子邻居扩充因子和局部影响因子来描述粒子的进化状态,并提出邻居扩充与约束策略来控制好粒子的影响力。实验结果表明,该算法具有较强的全局寻优能力和较好的寻优速度。

关 键 词:粒子群优化算法  邻居结构  种群熵  
收稿时间:2008-11-03

Particle Swarm Optimization Algorithm Using Dynamic Neighborhood Adjustment
CHEN Zi-Yu,HE Zhong-Shi,ZHANG Cheng.Particle Swarm Optimization Algorithm Using Dynamic Neighborhood Adjustment[J].Pattern Recognition and Artificial Intelligence,2010,23(4):586-590.
Authors:CHEN Zi-Yu  HE Zhong-Shi  ZHANG Cheng
Affiliation:College of Computer Science,Chongqing University,Chongqing 400044
Abstract:To keep a balance between global searching ability and searching speed, a particle swarm optimization algorithm using dynamic neighborhood adjustment (PSODNA) is presented. According to swarm diversity variation and evolutionary state, neighborhood structure of the particle swarm is dynamically changed in PSODNA. Population entropy is introduced to estimate swarm diversity. Particle neighborhood extension factor and local effect factor are defined to describe the evolutionary state. And neighborhood expansion and constraint strategies are proposed to control the influence of good particles. The experimental results show that the proposed algorithm has great superiority both in global searching ability and searching speed.
Keywords:Particle Swarm Optimization  Neighborhood Structure  Population Entropy  
本文献已被 万方数据 等数据库收录!
点击此处可从《模式识别与人工智能》浏览原始摘要信息
点击此处可从《模式识别与人工智能》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号