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

基于混沌搜索的混和粒子群优化算法
引用本文:张劲松,李歧强,王朝霞.基于混沌搜索的混和粒子群优化算法[J].山东工业大学学报,2007,37(1):47-50,114.
作者姓名:张劲松  李歧强  王朝霞
作者单位:[1]山东大学控制科学与工程学院,山东济南250061 [2]山东轻工业学院电子信息与控制工程学院,山东济南250353
基金项目:山东省自然科学基金资助项目(Y2003G01);山东省优秀中青年科学家奖励基金项目(2004BS01004)
摘    要:所提出的算法将粒子群优化算法和混沌算法相结合,既摆脱了算法搜索后期易陷入局部极值点的缺点,同时又保持了前期搜索的快速性,最后通过4个测试函数将该算法与基本粒子群算法进行仿真对比,比较结果表明基于混沌搜索的混和粒子群优化算法在收敛性和稳定性等方面明显优于基本粒子群优化算法.

关 键 词:粒子群优化算法  混沌搜索  混和算法  遍历性  局部极值
文章编号:1672-3961(2007)01-0047-04
修稿时间:2005-12-29

Hybrid particle swarm optimization algorithm based on the chaos search
ZHANG Jin-song, LI Qi-qiang, WANG Zhao-xia.Hybrid particle swarm optimization algorithm based on the chaos search[J].Journal of Shandong University of Technology,2007,37(1):47-50,114.
Authors:ZHANG Jin-song  LI Qi-qiang  WANG Zhao-xia
Affiliation:1. School of Control Science and Engineering, Shandong University, Jinan 250061, China; 2. College of Electronic Information and Control Engineering, Shandong Institute of Light Industry, Jinan 250353, China
Abstract:A hybrid particle swarm optimization algorithm based on the chaos search is proposed. It can not only overcome the disadvantage of easily getting into the local extremum in the later evolution period, but also keep the rapidity of the previous period. Finally, the basic particle swarm optimization algorithm is compared with the hybrid algorithm. The experiment results demonstrate that the new algorithm proposed is better than the basic particle swarm optimization algorithm in the aspects of convergence and stability.
Keywords:particle swarm optimization algorithm  chaos search  hybrid algorithm  ergodicity  local extremum
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号