| 摘要: |
| 随着高电压网架的发展，解开电磁环网，进行电网分层分区运行是未来电网的发展趋势。电网分区运行可有效缓解目前网架结构错综复杂和短路电流超标严重等问题。提出了一种基于Dijkstra算法的电网分区新方法。首先，结合图论的有关知识将电力网络转换成网络拓扑图，将网架中的站点和线路阻抗与拓扑图中节点和权值相对应。然后，利用Dijkstra算法寻找距离初始点最短路在规定距离内的站点，将符合要求的站点与初始点划分为同一分区。以500 kV/220 kV电网为例，由于未来电网的发展趋势为高电压等级网架起支撑作用，区间通过联络线进行连接，故选取500 kV站点为初始点，最终确定以500 kV站点为支撑的若干分区。所提出的方法可通过编程进行快速运算，无需多次求解。最后，以IEEE30节点系统和某地区实际电网为例，验证了所提方法的可行性和实用性。 |
| 关键词: 电网分区 短路电流超标 主网架 Dijkstra算法 |
| DOI：10.7667/PSPC170237 |
| 投稿时间：2017-02-22修订日期：2017-05-16 |
| 基金项目:广东电网有限责任公司科技项目(031900KK 52160023) |
|
| Power network partitioning method based on Dijkstra algorithm |
| LI Tong,XUE Feng |
| (Dongguan Power Supply Bureau, Guangdong Power Grid Corporation, Dongguan 523000, China) |
| 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. This work is supported by Science and Technology Project of Guangdong Power Grid Limited Liability Company (No. 031900KK52160023). |
| Key words: network partition short-circuit current exceeding standard main grid Dijkstra algorithm |
