摘要
为克服粒子群算法早熟收敛的缺点,通过引入变异和交叉算子,设计了一种新的粒子群算法.通过对常用测试函数的数值试验,说明了新算法不仅能有效地避免早熟收敛,而且具有更好的收敛速度.
In order to overcome the premature convergence of particle swarm optimization algorithm,an improved new algorithm is proposed by introducing mutation and crossover operators.Several benchmark functions are tested and the experimental results show that the new algorithm not only effectively solves the premature convergence problem,but also significantly speeds up the convergence.
出处
《陕西科技大学学报（自然科学版）》
2011年第4期121-124,共4页
Journal of Shaanxi University of Science & Technology
基金
国家自然科学基金资助项目(6067106310902062)
关键词
变异
交叉
粒子群算法
优化
早熟收敛
mutation
crossover
particle swarm
opertimization
premature convergence
