电力系统保护与控制2018，Vol.46Issue(5)：159-165,7.DOI:10.7667/PSPC170237
基于Dijkstra算法的电网分区方法研究
Power network partitioning method based on Dijkstra algorithm
摘要
Abstract
With the development of the high voltage grid, it is the trend of the future power grid to unlock the electromagnetic loop network and to divide the grid. Grid division operation can effectively alleviate the phenomenon of complex grid structure and exceeded short-circuit current. A new method for power grid division based on Dijkstra algorithm is presented. Firstly, based on the knowledge of graph theory, the power network is transformed into the network topology, with the site and line impedance in the grid corresponding to the nodes and weights in the topology graph. Secondly, it finds the sites of which the shortest path from the initial site to the site within the specified range by Dijkstra algorithm. Taking 500 kV/220 kV power grid as an example, due to the development trend of the future power grid supplying high voltage level network with supporting role, the intervals are connected through the tie line, so 500 kV sites are selected as the initial station and some grid partition supported by 500 kV station can be determined. The proposed method can be calculated fast by programming without repeatedly solving. Finally, an IEEE30 node system and a practical power grid in a certain region are taken as examples, which demonstrates the effectiveness and practicability of the proposed method.关键词
电网分区/短路电流超标/主网架/Dijkstra算法Key words
network partition/short-circuit current exceeding standard/main grid/Dijkstra algorithm引用本文复制引用
李通,薛峰..基于Dijkstra算法的电网分区方法研究[J].电力系统保护与控制,2018,46(5):159-165,7.基金项目
广东电网有限责任公司科技项目(031900KK 52160023)This work is supported by Science and Technology Project of Guangdong Power Grid Limited Liability Company(No.031900KK52160023). （031900KK 52160023）
