计算机工程与应用2011，Vol.47Issue(23)：45-47,50,4.DOI:10.3778/j.issn.1002-8331.2011.23.013
一种新的混合粒子群方法
New hybrid particle swarm optimization
管月智 1葛洪伟1
作者信息
- 1. 江南大学信息工程学院,江苏无锡214122
- 折叠
摘要
Abstract
By introducing chaotic search and mutation mechanism, population can overcome the shortcomings of stagnation and trapping into local optimums.When the population is stagnation, chaotic search is used to find a better point firstly.If this point does not meet the precision of mutation, then mutation mechanism will make effort.Chaotic search can continuously optimize when the population is stagnation, mutation mechanism helps the population break away from local optimum when it has trapped into the local optimum.Experimental results show that the new algorithm is relatively obvious for the ability of global optimization.关键词
混沌/变异/粒子群优化/变异机制Key words
chaos/mutation/particle swarm optimization/mutation mechanism分类
信息技术与安全科学引用本文复制引用
管月智,葛洪伟..一种新的混合粒子群方法[J].计算机工程与应用,2011,47(23):45-47,50,4.
