基于受控混沌映射的简化粒子群优化算法  

Simplified particle swarm optimization based on controlled chaotic mapping

作　　者：赵志刚[1] 张福刚[1] 张振文[1] 

机构地区：[1]广西大学计算机与电子信息学院,南宁530004

出　　处：《计算机工程与应用》2011年第33期46-48,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61063031)~~

摘　　要：为了克服粒子群算法早熟收敛和收敛精度不高的缺陷,提出了基于受控混沌映射的简化粒子群优化算法。该算法在采用去除了速度项的简化粒子群算法结构基础上,用受控混沌变量来描述惯性权值,并且对进化停滞的个体和全局极值进行变异操作。数值实验结果表明,新算法在收敛速度和收敛精度方面较已有方法有了明显提高,具有更强的摆脱局部极值的能力。A new Particle Swarm Optimization（PSO） algorithm is proposed based on three aspects of improvement in standard PSO to solve the problems about premature convergence and low precision.The iteration formula of PSO based on the simple PSO which removes the velocity parameter is applied.Inertia weight,an important factor in PSO,is determined using a controlled chaotic variable to enhance the balance of global and local search of algorithm.The mutation operators are introduced to adjust individual and global optimal to improve the search performance of algorithm.The simulation experiments show that the proposed algorithm not only has great advantages of convergence property over standard PSO and some other modified PSO algorithms,but also effectively avoids being trapped in local minima.

关 键 词：粒子群优化算法 混沌 惯性权重 变异 

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