一种改进的粒子群优化算法  

Novel Arithmetic Based on Particle Swarm Optimization

作　　者：黄辉先[1] 陈资滨[1] 

机构地区：[1]湘潭大学信息工程学院,湖南湘潭411105

出　　处：《系统仿真学报》2007年第21期4922-4925,共4页Journal of System Simulation

基　　金：湖南省自然科学基金(06JJ5112);湘潭大学跨学科交叉项目(05IND04)

摘　　要：针对非线性优化问题讨论了一种基于迭代进程和适应值综合的自适应变异粒子群优化算法,该算法按照自适应变异方法从迭代进程上、以及从目标函数适应值上调整速度惯性因子,同时结合正态变异算子调整搜索方向。采用专用测试函数进行仿真测试分析,结果表明改进算法收敛,具有很高的搜索效率和求解精度。A novel arithmetic was proposed based on particle swarm optimization （PSO）, which concentrated the advantages of the successive recurs＇ion process of adaptive mutation and the fitness of adaptive mutation. And the normal mutation arithmetic was also used to adjust the searching direction. Special functions were used to verify the stability and response speed of the arithmetic. The simulation results show that the nonlinear optimizing problem with the objective model functions can be solved with high searching efficiency and solution accuracy under the proposed method.

关 键 词：粒子群优化 自适应变异 正态变异 非线性优化问题 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]