中国电力2017，Vol.50Issue(4)：52-58,7.DOI:10.11930/j.issn.1004-9649.2017.04.052.07
基于图分割的潮流计算中的节点优化编号
Node Ordering in Power Flow Calculation Based on Graph Partitioning Algorithm
摘要
Abstract
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 effectiveness of the proposed algorithm can satisfy online computing requirements.关键词
节点优化编号/图分割/电力系统计算/多层次嵌套排序Key words
node ordering/graph partitioning/power system calculation/nested dissection ordering algorithms分类
信息技术与安全科学引用本文复制引用
唐灿,郭睿,顾黎强,董树锋..基于图分割的潮流计算中的节点优化编号[J].中国电力,2017,50(4):52-58,7.基金项目
国家高技术研究发展计划(863计划)资助项目(2014AA051901) （863计划）
国家自然科学基金资助项目(51207136)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). （51207136）
