基于空间方向关系的配电网实用最佳抢修路径算法  

The Algorithm of Distribution Network Practical Optimal Rush Repair Path Based Spatial Direction

作　　者：朱有产[1] 王春梅[1] 刘虎[1] 

机构地区：[1]华北电力大学信息与网络管理中心,071003

出　　处：《电气应用》2006年第1期41-43,共3页Electrotechnical Application

摘　　要：以经典Dijkstra算法搜索时的无方向性及实际交通网络特有的空间分布特性为基础,提出了一种求配电网最佳抢修路径算法,算法的复杂度和网络节点N成线性关系,验证了该算法是一种实用、高效的最短路径分析解决方案。Based on the non-directional characteristics of the classical Dijkstra algorithm during the search and the particular spatial distribution of a real city transportation network, the algorithm of optimal rush repair path of the distributed network is put forward and the conclusion that the algorithm＇s complexity is proportion to the power of the number of nodes is presented. The instance shows that the algorithm is a practical and efficient realization of the shortest path analysis.

关 键 词：交通网络 最短路径 DIJKSTRA算法 空间方向 

分 类 号：TM744[电气工程—电力系统及自动化]