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

简化粒子群优化方法的改进研究
引用本文:周昊天,吴志勇,田雨波.简化粒子群优化方法的改进研究[J].计算机工程与应用,2012,48(24):41-44.
作者姓名:周昊天  吴志勇  田雨波
作者单位:江苏科技大学电子信息学院,江苏镇江,212003
基金项目:国家部委科技预研基金项目;江苏高校优势学科建设工程资助项目
摘    要:为了有效提高粒子群优化算法的收敛速度和搜索精度,增强算法跳出局部最优,寻得全局最优的能力,提出了一种改进的简化粒子群优化算法。该算法考虑了粒子惯性、个体经验和全局经验对于位置更新影响力的不同,改进了位置更新公式,克服了粒子群优化算法收敛速度慢和易陷入局部最优的缺点。标准函数测试结果表明该改进算法的收敛速度和搜索精度有了很大的提高。

关 键 词:简化粒子群优化算法  收敛  改进

Research on improving Simple Particle Swarm Optimization
ZHOU Haotian , WU Zhiyong , TIAN Yubo.Research on improving Simple Particle Swarm Optimization[J].Computer Engineering and Applications,2012,48(24):41-44.
Authors:ZHOU Haotian  WU Zhiyong  TIAN Yubo
Affiliation:School of Electronics and Information,Jiangsu University of Science and Technology,Zhenjiang,Jiangsu 212003,China
Abstract:In order to improve the convergence speed and search accuracy of Particle Swarm Optimization algorithm,enhance the algorithm’s ability to jump out of the local extremum and find the global extremum,an improved Simple Particle Swarm Optimization algorithm is given.The algorithm takes the influence of particle inertia,the individual experience and global experience into account and improves the position update formula.The improved algorithm can overcome shortcomings of slow convergence and easy to fall into local extremum.Standard functions test results show that the algorithm’s convergence speed and search accuracy have been greatly improved.
Keywords:Simple Particle Swarm Optimization(SPSO)  convergence  improve
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号