首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种改进的粒子群优化算法
引用本文:黄辉先,陈资滨.一种改进的粒子群优化算法[J].系统仿真学报,2007,19(21):4922-4925.
作者姓名:黄辉先  陈资滨
作者单位:湘潭大学信息工程学院,湖南,湘潭,411105
基金项目:湖南省自然科学基金;湘潭大学跨学科交叉项目
摘    要:针对非线性优化问题讨论了一种基于迭代进程和适应值综合的自适应变异粒子群优化算法,该算法按照自适应变异方法从迭代进程上、以及从目标函数适应值上调整速度惯性因子,同时结合正态变异算子调整搜索方向。采用专用测试函数进行仿真测试分析,结果表明改进算法收敛,具有很高的搜索效率和求解精度。

关 键 词:粒子群优化  自适应变异  正态变异  非线性优化问题
文章编号:1004-731X(2007)21-4922-04
收稿时间:2006-08-31
修稿时间:2006-12-20

Novel Arithmetic Based on Particle Swarm Optimization
HUANG Hui-xian,CHEN Zi-bin.Novel Arithmetic Based on Particle Swarm Optimization[J].Journal of System Simulation,2007,19(21):4922-4925.
Authors:HUANG Hui-xian  CHEN Zi-bin
Institution:College of Information Engineering, Xiangtan University, Xiangtan 411105, China
Abstract:A novel arithmetic was proposed based on particle swarm optimization(PSO),which concentrated the advantages of the successive recursion 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.
Keywords:particle swarm optimization  adaptive mutation  normal mutation  nonlinear optimization problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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