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

基于Tent映射的混沌粒子群优化算法
引用本文:武美先,张学良.基于Tent映射的混沌粒子群优化算法[J].太原科技大学学报,2011,32(3):242-245.
作者姓名:武美先  张学良
作者单位:太原科技大学,太原,030024
摘    要:针对粒子群算法在迭代后期易陷入局部最优的不足,采用Tent映射所产生的混沌序列在粒子个体最优点和全局最优点附近进行混沌搜索,利用混沌搜索的全局遍历性和随机性提高了粒子群优化算法的全局搜索能力和抗早熟收敛性能。几个典型测试函数的仿真结果证明了该算法的可行性。

关 键 词:Tent映射  混沌  粒子群优化算法  多样性

A Chaotic Particle Swarm Optimization Algorithm Based on Tent Mapping
WU Mei-xian,ZHANG Xue-liang.A Chaotic Particle Swarm Optimization Algorithm Based on Tent Mapping[J].Journal of Taiyuan University of Science and Technology,2011,32(3):242-245.
Authors:WU Mei-xian  ZHANG Xue-liang
Affiliation:WU Mei-xian,ZHANG Xue-liang(Taiyuan University of Science and Technology,Taiyuan 030024)
Abstract:To enhance the searching efficiency of particle swarm optimization algorithm(PSO),tent mapping was introduced into PSO as a strategy of chaotic optimization searching to avoid PSO getting into local best and appearing premature convergence.The feasibility of the new algorithm named chaotic particle swarm optimization algorithm based on tent mapping(CTPSO) was verified by some typical test functions given in the paper.The results show that global ergodic property and randomness of chaotic searching can impro...
Keywords:Tent mapping  chaotic  particle swarm optimization algorithm  diversity  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号