基于改进的邻接矩阵分层搜索前推回代法在潮流计算中的应用

Application of the Search Forward and Backward Substitution Method Based on the Adjacency Matrix in the Flow Calculation

分析了现有配电网网基结构特点及计算方法,提出节点与节点的邻接矩阵进行分层搜索的配电网潮流算法。不需事先分析与定义支路,当邻接矩阵分层搜索后得到节点分层矩阵,通过节点分层矩阵赋值给支路完成对支路的定义,可快速实现对辐射状配电网拓扑结构识别并进行实用潮流计算。编程过程实用简单,清晰明了,并且运用稀疏化手段与矢量运算技巧提高程序的运行速度,仿真算例说明所提的方法是有效的。

This paper analyzes the characteristics and calculation methods of the existing network-based structure of the distribution network, and proposes a hierarchical search method based on the adjacency matrix between nodes for calculation of the load flow of the distribution network. This method does not need prior analysis and or the definition of the slip road. With the layered matrix of nodes obtained through hierarchical search of the adjacency matrix, the hierarchical matrix can assign the branch node to complete definition of the slip. Identification of the topology of the radial distribution network can be efficiently realized quickly, and practical flow calculations can be conducted. This entire programming process is simple, clear, and practical. The use of sparse vector operation means and technique helps to improve the running speed. The proposed method is proveds to be effective through simulation.