电网拓扑分析算法的研究  

Study on Power Network Topology Analytic Algorithm

作　　者：黄正[1] 陈凡[1] 张雪娇[1] 王寒娜[1] 刘思明[1] 

机构地区：[1]南京工程学院电力工程学院,江苏南京211167

出　　处：《南京工程学院学报（自然科学版）》2013年第2期43-49,共7页Journal of Nanjing Institute of Technology(Natural Science Edition)

基　　金：南京工程学院大学生科技创新基金项目(N20130407;N20130422);南京工程学院科研基金项目(QKJA2011003)

摘　　要：介绍树搜索法、邻接矩阵法、节点标记法三种方法进行电网拓扑分析的原理,指出三种算法中考虑网络中局部支路开关变化时的网络数据模型的修正方法.分别采用三种方法对RBTS和RTS79的输电网络、RBTS-BUS6的配电网络进行电网连通性分析.算例分析表明:树搜索法进行环网拓扑分析时,重复搜索较多;邻接矩阵法的直观性较好,但是数据储存空间开销大,自乘运算的时间随着网络增大而迅速增加,适合小规模网络连通性分析;节点标记算法高效快捷、占用内存少,较适合进行大规模电网的连通性分析.This paper introduces three methods as a principle for analyzing power network topology, i. e., tree search method, adjacency matrix method and node notation method. The correction method of the three methods for the network~ data models are proposed when the local branch switches in the network change. Three methods are applied to the case studies of transmission network of RBTS and RTS79, and distribution network of RBTS-BUS6. The calculation analysis shows that tree search method executes a lot of repeated search when it is used in the loop network. The adjacency matrix method needs large data storage space and its operation time grows rapidly with the increase of network scale. It is therefore applicable to small-scale network connectivity analysis. In contrast, node notation method is highly efficient and quick, and needs less memory. Therefore, it is more suitable for large-scale power networks connectivity analysis.

关 键 词：电网拓扑 树搜索法 邻接矩阵法 节点标记法 

分 类 号：TM769[电气工程—电力系统及自动化]