配电网快速网络拓扑分析算法  

Fast network topology method for a distribution network

作　　者：姚玉斌[1] 晋文转 靳力[1] 

机构地区：[1]烟台东方电子信息产业股份有限公司,山东烟台264001 [2]许昌继电器研究所,河南许昌461000

出　　处：《继电器》2005年第19期31-35,共5页Relay

摘　　要：缩小搜索范围是提高拓扑速度的关键,输电网可采用厂站内搜索法来缩小搜索范围,配电网则不适合。给数据排序是缩小搜索范围的有效措施,但排序比较费时。为此,提出了把全局拓扑分成静态拓扑和动态拓扑的想法。静态拓扑仅处理排序工作,可预先计算;每次全局拓扑只运行动态拓扑,由于数据已经排序,计算速度很快。同时提出了使用节点支路关联数据形成岛的方法,由于此数据可以在静态拓扑中处理,因而进一步提高了配电网网络拓扑的计算速度。实际算例验证了所提出的算法的有效性。The most effective way to speed up network topology is to reduce searching range. Topological analysis for a transmission network can reduce searching range by the method of searching within a station, but this method is not adaptive to a distribution network. Data sorting is another good method to reduce searching range, but data sorting is a time-consuming task. So it is proposed that overall network topology be divided into static network topology and dynamic network topology. Static network topology only deals with data sorting and works in advance, and dynamic network topology realizes topology actually. By using of sorted data, the speed of network topology is greatly increased. And it is also proposed to form islands by node-branch list which can be sorted in static network topology. This method can speed up network topology for further for a distribution network. The results of some practical examples prove the effectiveness of the two proposed method.

关 键 词：配电网 网络拓扑 全局网络拓扑 静态网络拓扑 动态网络拓扑 

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