基于网络简化和深度优先遍历的配电网路径搜索算法

供电路径分析在配电网分析中有着重要作用,但实际中配电网往往结构复杂,在搜索供电路径前需对配电网模型进行适当的简化处理。文中提出一种基于公共信息模型(CIM)的配电网网络模型简化方法,以及在其简化结果上的一种基于深度优先遍历的配电网路径搜索算法。首先,将配电网模型存储在图数据结构中,利用图论算法进行网络简化。随后,通过路径搜索算法搜索得到负荷节点的所有供电路径,并经过分类得到3类路径集合:按电源分类、按路径终点负荷分类和按路径经过支路分类的路径集合。该路径搜索算法可用于配电网拓扑结构和支路通断状态等配电网分析描述中。最后,以某省会城市的一个实际配电网架和IEEE 123节点系统为例,分别验证了网络简化方法和路径搜索算法的有效性和实用性。

A Path Searching Algorithm for Distribution Network Based on Network Simplification and Depth First Traversal

The power supply paths play an important role in the distribution network analysis. However, the distribution network is often complex in practice and it is necessary to simplify the distribution network model before searching the power supply paths. A simplified method of distribution network model based on common information model(CIM)and a path searching algorithm for distribution network based on the depth first traversal in the network simplification results are proposed. Firstly, the distribution network model is stored in a graph data structure and the network is simplified by using the graph theory algorithms. Subsequently, all the power supply paths of load nodes are searched in the distribution network by the path searching algorithm and classified into three categories of path sets respectively in terms of electric source, the load at the end of paths and the branch which the paths pass through. The path searching algorithm can be applied to the distribution network analysis such as describing the topological structure of the distribution network and the state of the branch switches. Finally, a typical distribution network framework in a provincial capital and IEEE network with 123 nodes are taken as examples to validate the effectiveness and practicability of the proposed network simplification method and path searching algorithm.