基于图分割的潮流计算中的节点优化编号  

Node Ordering in Power Flow Calculation Based on Graph Partitioning Algorithm

作　　者：唐灿[1] 郭睿 顾黎强 董树锋[1] 

机构地区：[1]浙江大学电气工程学院,浙江杭州310027 [2]国网上海浦东供电公司,上海200122

出　　处：《中国电力》2017年第4期52-58,共7页Electric Power

基　　金：国家高技术研究发展计划(863计划)资助项目(2014AA051901);国家自然科学基金资助项目(51207136)~~

摘　　要：随着社会的发展,电网的拓扑结构变得越来越复杂,电力系统潮流计算的维数也越来越大,适当的节点优化编号能够有效地加速电力系统的潮流计算。电力网络作为一种无标度的网络,可以抽象成图来表示各个节点之间的拓扑关系,为了解决电力系统潮流计算中的节点优化编号问题,提出了基于图分割算法中的多层次嵌套排序算法进行节点优化编号的方法,大幅提高了节电优化编号的速度,能够有效地加速大规模系统的潮流计算,并以IEEE14节点算例为例,介绍了所提方法的流程。算例结果验证了该算法无论是在速度上还是在内存占用均优于传统方法,能够更有效地满足大规模电网潮流计算的需求。With the development of society, the topology of power grid is becoming more and more complex, and the dimension of power flow calculation is growing accordingly. Against this background, appropriate node ordering is needed to effectively accelerate the power flow calculation. As a scale-free network, the power system network can be abstracted into a graph to represent the topological relations between the various nodes. To solve the problem of node ordering, this paper presents a method based on dissection ordering algorithms to optimize node number, which can accelerate the speed of node ordering and power flow calculation of large scale system. Based on an example of IEEE 14-bus system, the process of the proposed method is described. The simulation results show that the speed and effeetiveness of the proposed algorithm can satisfy online computing requirements. This work is supported by National High Technology Research and Development Program of China （863 Program） （No. 2014AA051901） and National Natural Science Foundation of China （No. 51207136）.

关 键 词：节点优化编号 图分割 电力系统计算 多层次嵌套排序 

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