| 一种新的改进粒子群算法 |
| |
| 引用本文： | 段玉红.一种新的改进粒子群算法[J].甘肃联合大学学报(自然科学版),2011,25(6). |
| |
| 作者姓名： | 段玉红 |
| |
| 作者单位： | 宁夏大学数学与计算机学院,宁夏银川,750021 |
| |
| 基金项目： | 国家自然科学基金项目(60962006); 宁夏大学自然科学基金项目(NDZR10-37) |
| |
| 摘 要： | 针对粒子群算法应用于复杂函数优化时可能出现过早收敛于局部最优解的情况,提出了一种改进的算法结构.通过构造单个粒子的多个进化方向和类似于蚂蚁群算法信息素表的选择机制,保留了粒子的多种可能进化方向,并对全局最优解进行变异.提高了粒子间的多样性差异,从而改善算法能力.改进后的粒子群算法的性能优于带线性递减权重的粒子群算法.
|
| 关 键 词： | 粒子群算法 进化计算 蚁群算法 变异 |
A New Improved Particle Swarm Optimization Algorithm |
| |
| DUAN Yu-hong.A New Improved Particle Swarm Optimization Algorithm[J].Journal of Gansu Lianhe University :Natural Sciences,2011,25(6). |
| |
| Authors: | DUAN Yu-hong |
| |
| Affiliation: | DUAN Yu-hong(School of Mathematics and Computer Science,Ningxia University,Yinchuan 750021,China) |
| |
| Abstract: | To improve the PSO algorithm which is a new population based optimization algorithm against trapping into local minima,a new PSO algorithm combing ant colony strategy and mutation strategy with PSO(AMPSO) is presented.In AMPSO some potential evolution directions are constructed for each particle in PSO,at the same time a strategy is presented to choose which one may be the local best for PSO evolution process just like pheromone table in ant colony algorithm,and the global optimization is mutated,Thus algor... |
| |
| Keywords: | particle swarm optimization algorithm global optimization ant colony algorithm mutation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
