一种求解高校路网的逆序变异的新混合PSO算法  

New Hybrid PSO Algorithm of Inverted Sequence Variation to Solve University Path

作　　者：方昕[1] 

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

出　　处：《计算机与现代化》2012年第9期143-146,共4页Computer and Modernization

基　　金：安康学院计算机应用技术重点学科项目(AKXYZDXK003);陕西省计算机科学与技术研究项目(2010JM3020);安康学院计算机科学与技术重点学科项目(2010)

摘　　要：针对标准粒子群算法在求解路网问题时显现出易陷入局部极值的问题,根据高校地理数据,提出一种求解高校路网的逆序变异的新混合PSO算法。为平衡算法的全局和局部搜索能力及增强种群多样性,将一种自平衡策略作为变异条件,在产生新的群体中按照逆序变异率算子对粒子进行位置变异,从而使得粒子摆脱局部极值后继续进行迭代更新操作。以Visual Studio 2005中C++编程实现实验仿真,结果表明此算法不但能有效求解高校路网问题,而且新算法收敛精度高,有效克服了早熟收敛问题。Standard Particle Swarm Optimization（SPSO） easily leads to premature convergence in optimizing path problem. To o- vercome this shortcoming and according to university geographic coordinates, a new hybrid PSO algorithm of inverted sequence variation is proposed for solving university path problem. To balance the ability of local search and global search of PSO and en- hance the population diversity, variation condition is a self-balancing strategy. According to the reverse mutation rate operator, new groups start to do position variation for the particles to get rid of local minima and continue iterative update operation. The C ＋＋ programming of Visual Studio 2005 is used to make simulation. The results show that this algorithm can not only effectively solve the university path problem, but also is of high convergence precision and overcomes premature convergence effectively.

关 键 词：高校路网 逆序变异率算子 逆序变异 新混合PSO算法 

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