电力网络拓扑分析与源流路径链生成算法  

Algorithm of Power Network Topology Analysis and Path Chains Generation

作　　者：陈彬[1,2] 于继来[1] 

机构地区：[1]哈尔滨工业大学电气工程系,哈尔滨150001 [2]福建省电力有限公司电力科学研究院,福州350007

出　　处：《电力系统及其自动化学报》2012年第1期25-31,共7页Proceedings of the CSU-EPSA

基　　金：国家自然科学基金资助项目(50477008)

摘　　要：为快速、准确和全面地求取电力网络源流路径链,提出了一种新型的网络拓扑分析与源流路径链生成算法。该算法首先根据电网某一拓扑结构及其潮流状态形成有向图和送端节点-送电支路邻接表,然后进行两轮拓扑分析,快速生成源流路径树,并由此获取相关的源流路径链。此算法无需通过基于图论邻接终点矩阵的复杂运算,简便快捷。此外,该算法可用于求解电力网络发生局部拓扑和局部潮流流向变化后的路径链局部修改问题。For obtaining path chains between sources and flows quickly,a new algorithm,which can analyze power network topology and generate path chains,was proposed in the paper.The algorithm firstly built directed graph and adjacency list between sending buses and sending branches based on the network topology and flow state;and then,it obtained path chain sets from the path chain trees which were generated through two rounds network topology.Getting rid of the adjacency matrix,the proposed algorithm is easier and faster.Moreover,it can change the path chains locally while the topology or the flow state changes in some part of the power network.

关 键 词：电力网络 拓扑分析 有向图 源流路径链 

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