期刊文献+

一种自适应惯性权重的粒子群优化算法 被引量:8

Adaptive Particle Swarm Optimization Algorithm with Dynamically Changing Inertia Weight
下载PDF
导出
摘要 为较好平衡粒子群算法中全局搜索能力与局部搜索能力,分析了PSO算法中的惯性权重与种群规模、粒子适应度以及搜索空间维度的关系,并把粒子惯性权重定义为这三者的函数.通过在每次迭代后更新每个粒子的惯性权重,实现了自适应调整全局搜索能力与局部搜索能力,并结合动态管理种群的策略提出了改进的粒子群算法.通过在多个常用测试函数上与已有惯性权重调整算法测试比较,证明新算法具有较强的全局寻优能力与较高的搜索效率. In order to get a better balance between global search ability and local search capabilities in the particle swarm algorithm,analyzed the relationship between inertia weight and the particle fitness,the population size and dimensions of the searching space,and constructed a function between them.After each iteration,updated the inertia weight of each particle as to achieved a self-adaptive adjustment of global search ability and local search capabilities.A new improved particle swarm optimization is brought up combined with population dynamic management strategy.The searching result of some standard testing functions proved that the new algorithm have a stronger global optimization capability and a higher search efficiency.
作者 陈占伟 李骞
出处 《微电子学与计算机》 CSCD 北大核心 2011年第3期27-30,共4页 Microelectronics & Computer
关键词 粒子群算法 自适应惯性权重 种群规模 搜索空间维度 粒子适应度 动态管理种群 PSO adaptive inertia weight population size the search space dimension particle fitness dynamic management of populations
  • 相关文献

参考文献7

  • 1Angeline P J. Using selection to improve particle swarm optimization [C]// IEEE International Conference on Evolutionary Computation. Anchorage, Alaska, USA: IEEE, 2007: 84-89.
  • 2Jacques Roget, Jacob SVesterstr. A diversity guided particle swarm optimizer, the ARPSO [ R ]. Technical Report 2002202, 2008 : 65- 69.
  • 3Shi Y, Eberhart R. A modified particle swarm optimizer [C] //IEEE World Conf on Computational Intelligence. Piscataway : IEEE , 2005 : 69- 73.
  • 4ZhangLP, Yu H J, HuSX. A new approach to im- prove particle swarm optimization[C] // Lecture Notes in Computer Science. Chicago : Springer2Verlag , 2006 : 134- 139.
  • 5任小康,郝瑞芝,孙正兴,史变霞.基于单纯形法的量子粒子群优化算法[J].微电子学与计算机,2010,27(1):154-157. 被引量:11
  • 6孙向军,赵斯强,严宗睿.基于粒子群优化的反潜搜索研究[J].微电子学与计算机,2008,25(10):91-93. 被引量:13
  • 7Salomon R. Reevaluating genetic algorithm performance under coordinate rotation of benchmark functions[J]. BioSystems, 1996(39) : 263-278.

二级参考文献13

  • 1王芳,邱玉辉.一种引入单纯形法算子的新颖粒子群算法[J].信息与控制,2005,34(5):517-522. 被引量:18
  • 2王芳,雷开友,邱玉辉.一种粒子群算法的多样性策略研究[J].计算机科学,2006,33(1):213-215. 被引量:2
  • 3熊伟丽,徐保国,吴晓鹏,肖应旺.带变异算子的改进粒子群算法研究[J].计算机工程与应用,2006,42(26):1-3. 被引量:12
  • 4Eberhart R, Kennedy J. A new optimizer using particles swarm theory[C]//Proc Sisth International Symposium on Micro Machine and Human Science. Japan, Nagoya, IEEE Servicecenter, Piscataway, 1995: 39 - 43.
  • 5Sun J, Feng B, Xu WB. Particle swarm optimization with particles having quantum behavior [ C]//Proceedings of 2004 Congress on Evolution Computation. China,Jiangsu, Piscataway, NJ : IEEE Press, 2004: 325 - 331.
  • 6Sun Jun, Feng Bin, Xu Wenbe. A global search strategy of quantum- behaved particleswarm optimization [ C]//IEEE Conference on Cybernetics and Intelligent System. China, Wuxi, Piscatawa NJ : IEEE Press,2004:1111 - 16.
  • 7Nelder J, Mead R. A simplex method for function minimization[J]. Computer Journal, 1965(7) :308- 31.
  • 8黄性惠,杨福渠,俞天仁.水面舰艇对潜扩展方阵应召搜索[D].大连:大连舰艇学院,1981.
  • 9金耀星.搜索时间最短的优化.论证与研究,1990,(6):13-17.
  • 10Higashi N, Lba H. Particle swarm optimization with gaussian mutation[C]//Proceeding of the IEEE Swarm Intelligence. USA: Indiana, 2003 :72 - 79.

共引文献22

同被引文献61

引证文献8

二级引证文献26

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部