Dijkstra算法在最佳抢修路径计算中的应用

Application of the Dijkstra algorithm in the best repairing path

为了保证配电网故障后的快速恢复正常供电,将D ijkstra算法应用于基于G IS配电网的最佳抢修路径计算中。借助电网G IS的系统网络,基于以空间换时间的方法,改进拓扑网络的存储形式使D ijkstra算法在最短的时间内计算出最佳抢修路径。采用三个数组来存储网络拓扑图,一个存储和路径相关的数据(ArcL ist);一个存储和节点相关的数据(NodeL ist),而数组ArcAttrib则用来记录各边的权值。最后通过算法实现证明了上述存储方法的可行性和快速性。

In order to quickly restore the normal power supply after the distribution network breakdown, this paper applies the Dijkstra algorithm for the best repairing path computation in distribution network based on GIS. This method aids the electrical GIS system network, based on the method of trading the time by the space, improves the way to store network and makes the Dijkstra algorithm calculate out the best repairing path in the shortest time. Three arrays are employed to store the distribution network graph. One is used for storing the datum correlated with path（ ArcList）. The other is used for storing the datum correlated with node （ NodeList）. And the array ArcAttrib is used for recording each side value. Finally, the storing method is proved feasibility and rapidity through the algorithm realization.