基于节点连通岛合并法网络动态拓扑分析.pdf

第41卷第5期
セ力系保护髟控制
Vol41 NoS
2013年3月1日
Power System Protection and Control
Mar.1.2013
基于节点连通岛合并法网络动态拓扑分析
张烨,周苏荃
哈尔滨エ业大学电气工程学院,黑龙江哈尔滨15000
摘要:基于图论相关理论,提出一种网络拓扑连通性分析算法一节点通岛合并法。该算法采用多维数组数据结构,既能
全面反映网络拓扑的各种信息,又存储部分中间运算结果,并根据网络中支路闭合、断开变化信息,快速、动态完成电气岛
的划分。此外,提出节点合并并行处理算法实现厂站组态快速拓扑分析,该方法不受网络具体接线方式的限制,克服了深度
和广度搜索算法并行运算的不足,提高了网络动於拓扑分析的效率,满足检测孤岛实时性需求。算法分析和算例表明、该算
法结枸清晰、高效快捷,是不同结构网络动态连通性分析的一种有效工具
关键词:连通岛;连通岛号;动态连通性;厂站组态;并行拓扑分析
Network dynamic topology analysis based on node connective island combined method
ZHANG Ye, ZHOU Su-quan
( School of Electrical Engineering and Automation, Harbin Institute of Technology, Harbin 150001, China)
Abstract: This paper proposes a kind of network typology connectivity analysis algorithm-node connective island combination
method based on the graph theory. The multidimensional array data structure which the method adopts can not only compietely
eflect the information of the networks topology, but also store parts of the operation results, According to the information of the
closed, disconnect branch in network, it can complete the division of the electrical island rapidly and dynamically. In addition, the
paper puts forward the node combination parallel pressing al or hm o complete plants and substations bus configuration fast
topology analysis. The method is not constrained with the network connective mode, overcomes the weakness of the depth first
search and breadth first search parallel processing algorithm and improves the efficiency of network dynamic topology analysis
which meets the real time demand on island de ection. The analysis of its al orithm and the results of examples show that the node
combination algorithm is an effective tool to complete topological division
This work is supported by National Natural Science Foundation of China(No 50177006 and No 50977017)
Key words: connective island connective island number; dynamic connectivity; plants and substations bus configuration; parallel
ology analy
中图分类号:TM7文献标识码:A
文章编号:1674-3415(2013)05-0072-05
0引言
日前网络拓扑分析方法主要有两种:树搜索
法?和邻接矩阵法7?。树搜索法分为基于深度优
电力系统网络拓扑分析是EMS/DMS高级应用先搜索法和广度优先搜索法0川。树搜索法对于变
软件的基础模块,是电力系统仿真和各种分析计算电站复杂接线方式和环网情况适应性较差。邻接
的基础叫,其运算速度直接影响高级应用软件的性矩阵法的运算复杂度是O(m2),另外图中任意支路状
能:此外,对于多重网络拓扑,采用传输断路器跳态发生变化时,该算法的重用性差2。近年米
间信号检测孤岛,该算法需要一个最新的分布式系 SCADA系统运用堆栈原理进行接线分析,该过程属
统拓扑信息?,高效的网络拓扑分析算法为实时控于搜索排队法,其运算次数随搜索元件数平方增
制等功能提供了技术保证。
长。基于深度优先搜索算法,由于其内在的顺序
性,不满足并行计算叫;基于广度优先搜索算法受
基金项目:国家科学自然基金资助项目(50177006,节点度数不确定性的影响,并行运算效率不高。
50977017)