基于改进粒子群算法的电力通信网最佳抢修路径问题的研究  

Research of the Best Repair Path Based on an Improved Particle Swarm Optimization in Power Communication Network

作　　者：张铭泉[1] 胥鸣[2] 秦文韬[2] 

机构地区：[1]华北电力大学计算机科学与技术学院,保定071003 [2]河南濮阳供电公司,濮阳457000

出　　处：《科学技术与工程》2008年第22期5990-5995,共6页Science Technology and Engineering

摘　　要：研究了改进的离散粒子群算法在电力通信网最佳抢修路径中的应用。粒子群优化算法是一种新型通用启发式算法,能够有效地求解大规模组合优化问题。在研究离散粒子群算法原理的基础上,引入记忆单元,实现粒子间信息共享,保证了粒子在寻优过程中能容易的跳出局部最优点,并能加速收敛到全局最优解。建立了电力通信网最佳抢修路径模型,构造了节点矩阵和速度矩阵,设计了求解算法,并编程进行了测试,实验结果表明了所提方法的可行性和有效性。The application of an improved discrete particle swarm optimization （DPSO） to the problem of the best repair path in power communication network is studied. The PSO is a new general-purpose meta-heuristic algorithm and has been demonstrated to be effective in solving hard combinatorial optimization problems. The principle of DPSO algorithm is studied, and then the memory unit is introduced to share the information of particles, so that it can easily run out the local optimum and provide high speed of convergence as well as for the proposed application. The mathematical model of the best repair path of power communication network is established and the solution algorithm is developed based on the mathematical model. The feasibility and efficiency of the algorithm are verified by the result of applying it to a sample system.

关 键 词：离散粒子群算法 电力通信网 GIS 最佳抢修路径 记忆单元 

分 类 号：O221.2[理学—运筹学与控制论]