一种求解最优路径的新型混合PSO算法研究  

A New Hybrid PSO Algorithm for Solving the Optimal Path

作　　者：吕方兴[1] 方昕[1] 

机构地区：[1]安康学院电子与信息工程系,安康725000

出　　处：《计算机与数字工程》2013年第2期165-167,170,共4页Computer & Digital Engineering

基　　金：安康学院高层次人才项目(编号:AYQDZR201203);安康学院高层次人才项目(编号:AYQDZR201204)资助

摘　　要：粒子群算法是新型智能优化算法且已被应用于诸多领域,但在求解最优路径时显现出易陷入局部最优的缺点。为此根据地理坐标数据通过数学公式推导得到PSO算法所需的初始化数据,在算法寻优过程中将自平衡策略和变异思想结合协助粒子群迭代与更新,提出一种求解最优路径的新型混合PSO算法。该算法引入了适合此问题的自平衡变异策略来提高算法求解精度,使得算法摆脱局部最优。实验以Visual Studio2005中C++编程实现仿真,结果表明此算法不但能有效求解最优路径问题,而且比离散PSO算法、自平衡PSO算法的解更优,从而性能得到改善。The PSO algorithm is a new intelligent optimization algorithm and has been used in many fields.But it easily trapped into local optimal in solving path problem.So according to geographic coordinate＇s data,initialization data is derived by a mathematical formula.Combined self-balancing strategy with variation idea,a new hybrid PSO algorithm is proposed to solve the university path problem.The algorithm is introduced self-balancing strategy for this problem to improve algorithm accuracy.There use C＋＋ programming of Visual Studio 2005.net.The results show that this algorithm can solve the optimal path problem.At the same time,it improved the performance and was better than the PSO algorithm and SDPSO algorithm.

关 键 词：最优路径 PSO算法 自平衡变异 混合PSO算法 

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