基于KRTG的动态拓扑结构的粒子群算法研究  

Particle Swarm Algorithm Based on the Dynamic Topology Structure of KRTG

作　　者：田玉玲[1] 杨朋樽[1] 

机构地区：[1]太原理工大学计算机与软件学院,太原030024

出　　处：《计算机与数字工程》2010年第2期25-27,81,共4页Computer & Digital Engineering

摘　　要：标准的粒子群优化算法作为一种随机全局搜索算法,因其在种群中传播速度过快,易陷入局部最优解。基于KRTG的动态拓扑结构的粒子群算法(KRTG-PSO),从粒子间的拓扑结构出发,动态地调整种群的拓扑结构,增加种群的多样性,使算法收敛于全局最优解。通过测试函数以及与其他算法的比较,并通过实验表明,该算法在收敛速度与数据精度上收到了满意的效果。The standard particle swarm optimization algorithm as a random global search algorithm, because of its rapid propagation in populations, easily into the local optimal solution. Based on the dynamic topology structure of KRTG particle swarm optimization （PSO）, KRTG- between particles from the topological structures, dynamically adjust the topological structure of population, can increase the diversity of population, the method converge to the global optimal solution. Through the test function and the comparison with other algorithm, experimental results show that the algorithm convergence picked up and the effect is satisfied.

关 键 词：动态 拓扑结构 粒子群 KTPG 适应度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]