基于图论算法的电网核心骨干网架构建

Construction of Core Backbone Grid Based on Graph Theory Algorithm

构建电网核心骨干网架能够保证电网在灾害期间对重要节点的供电,并有利于电网在灾后的快速恢复,为社会减少经济损失。对此,在电网节点、线路重要度评估基础上,基于图论算法给出了一种电网核心骨干网架构建方法。首先根据核心骨干网架的期望规模与节点重要度排序确定必须留存的重要节点,同时判别这些节点的电源容量与负荷容量是否匹配,并给出了增加电源节点的规则;其次,以原电网中各线路的重要度作为其权值,计算留存节点之间的最短路径及其对应的线路列;接着,求解留存节点之间的最短路径所构成图的最小生成树,并将树中的每条边用其对应的线路序列进行替代,得到初步的核心骨干网架;最后,对初步网架进行安全运行校验,得到最终的核心骨干网架。该方法能够更直接地将重要节点留存在核心骨干网架之中,同时兼顾经济性,使网架的规模尽可能小。

It is able to ensure power supply for important nodes during disaster period by constructing core backbone grid for the power grid as well as make for rapid recovery of the power grid and reduce economic loss for the society. Therefore, on the basis of importance evaluation for nodes and transmission lines of the power grid, this paper presents a construction method for core backbone grid based on graph theory algorithm. Firstly, according grid and node importance sorting , it determines important nodes must be retained and decisource and load are matching , and presents rules for increasing power source node.. Secondly , taking importance degrees of transmission lines of the power grid as weights , it calculates shortest paths and correspondinnodes. Then, it solves theminimum spanning tree of the graph constructed by the shortest paths and replaces every path ofthe tree by its corresponding line sequence so as to obtain initial core backbone grid. Finally , it can obtain the ultimate core backbone grid by verifying security operation of the initial grid. This method can directly keep important nodes in the core backbone grid and takes account of economy , which ensures the scale of grid as small as possible.