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

结合局部优化算法的改进粒子群算法研究
引用本文:殷脂,叶春明,温蜜. 结合局部优化算法的改进粒子群算法研究[J]. 计算机工程与应用, 2011, 47(9): 51-53. DOI: 10.3778/j.issn.1002-8331.2011.09.014
作者姓名:殷脂  叶春明  温蜜
作者单位:1.上海理工大学 管理学院,上海 200093 2.上海电力学院 计算机与信息工程学院,上海 200090
基金项目:国家自然科学基金,上海市高校选拔培养优秀青年教师科研专项基金资助项目No.sdl-07013)
摘    要:提出了结合局部优化算法的改进粒子群算法(Combination Particle Swarm Optimization,CPSO),粒子群算法虽然通过群体规模来规避早熟,但缺乏局部快速搜索能力,因此将局部优化算法与改进粒子群算法相结合,并尝试不同的局部优化算法,例如牛顿法、最速下降法,通过典型函数优化实验表明,与其他改进粒子群算法相比,CPSO具有较强的寻优能力,鲁棒性和较快的收敛速度;实验也表明不同的局部优化算法在不同的特征函数上体现出不同的优势。

关 键 词:粒子群优化算法  牛顿法  最速下降法  优化效率  
修稿时间: 

Research on combination algorithm of particle swarm optimization and local optimization
YIN Zhi,YE Chunming,WEN Mi. Research on combination algorithm of particle swarm optimization and local optimization[J]. Computer Engineering and Applications, 2011, 47(9): 51-53. DOI: 10.3778/j.issn.1002-8331.2011.09.014
Authors:YIN Zhi  YE Chunming  WEN Mi
Affiliation:1.Business School,University of Shanghai for Science and Technology,Shanghai 200093,China 2.School of Computer and Information Engineering,Shanghai University of Electric Power,Shanghai 200090,China
Abstract:This paper proposes an algorithm which is a combination algorithm of particle swarm optimization and local optimization named CPSO.CPSO incorporates the advantages of the local optimization and PSO.Different local optimization algorithms are tried.Finally several experiments are performed on typical functions.Compared with other PSO algorithms,CPSO shows excellent global searching,robustness and rapid constringency;several numerical examples also show that different local optimization algorithms own their different advantages of different types of target functions.
Keywords:particle swarm optimization  Newton algorithm  steepest-descent algorithm  optimization efficiency
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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