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

基于自适应惯性权重的混沌粒子群算法
引用本文:周燕,刘培玉,赵静,王乾龙.基于自适应惯性权重的混沌粒子群算法[J].山东大学学报(理学版),2012,47(3):27-32.
作者姓名:周燕  刘培玉  赵静  王乾龙
作者单位:山东师范大学信息科学与工程学院,山东济南250014/山东省分布式计算机软件新技术重点实验室,山东济南250014
基金项目:国家自然科学基金资助项目(60873247);山东省高新自主创新专项工程项目(2008ZZ28);山东省自然科学基金重点项目(ZR2009GZ007)
摘    要:针对粒子群优化(particle swarm optimization,PSO)算法易陷入早熟的缺陷,提出了一种基于自适应惯性权重的混沌粒子群算法。首先利用立方映射产生的混沌序列对粒子位置进行初始化,为全局搜索的多样性奠定基础;然后采用自适应惯性权重优化策略,提高收敛速度;最后如果判断算法陷入早熟,则对算法进行混沌扰动,使其跳出局部最优。仿真实验结果表明,改进算法的收敛速度及收敛精度都有明显提高,能有效地避免早熟。

关 键 词:粒子群算法  立方映射  自适应惯性权重  混沌扰动

Chaos particle swarm optimization based on the adaptive inertia weight
ZHOU Yan,LIU Pei-yu,ZHAO Jing,WANG Qian-long.Chaos particle swarm optimization based on the adaptive inertia weight[J].Journal of Shandong University,2012,47(3):27-32.
Authors:ZHOU Yan  LIU Pei-yu  ZHAO Jing  WANG Qian-long
Affiliation:1,2(1.School of Information Science and Engineering,Shandong Normal University,Jinan 250014,Shandong,China; 2.Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology, Jinan 250014,Shandong,China)
Abstract:Aiming at the premature convergence problem which the particle swarm optimization algorithm suffers from,a chaos particle swarm optimization based on adaptive inertia weight is proposed.Firstly,chaotic sequence generated by cube map is used to initiate individual position,which strengthens the diversity of global searching.Secondly,adaptive inertia weight is adopted to improve the convergence rate.Furthermore,chaos perturbation is utilized to avoid the premature convergence.The results of the simulation experiment show that the convergence rate and the precision of the improved algorithm are obviously enhanced,and the algorithm can effectively avoid the premature convergence problem.
Keywords:particle swarm optimization  cube map  adaptive inertia weight  chaos perturbation
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号