首页 | 本学科首页   官方微博 | 高级检索  
     

基于割点和路径搜索的输电断面快速识别方法
引用本文:苗世洪,马帅,尚亚男,姜臻,侯俊贤,于之虹.基于割点和路径搜索的输电断面快速识别方法[J].电力系统自动化,2014,38(2):39-45.
作者姓名:苗世洪  马帅  尚亚男  姜臻  侯俊贤  于之虹
作者单位:强电磁工程与新技术国家重点实验室,华中科技大学,湖北省武汉市430074;强电磁工程与新技术国家重点实验室,华中科技大学,湖北省武汉市430074;强电磁工程与新技术国家重点实验室,华中科技大学,湖北省武汉市430074;强电磁工程与新技术国家重点实验室,华中科技大学,湖北省武汉市430074;中国电力科学研究院,北京市100192;中国电力科学研究院,北京市100192
基金项目:国家高技术研究发展计划(863计划);国家电力公司科技项目
摘    要:提出了一种基于割点和路径搜索的输电断面快速识别方法。该方法依据过载支路切除后的潮流转移特征定义了输电断面,并借助图论中的割点和块以及最短路径等概念,深入分析了输电断面的拓扑特征;通过一系列的矩阵运算,在以断开支路为中心的块中搜索出断开支路两端点间的前k条最短路径,并最终识别出受支路断开影响最严重的输电断面。文中在电网模型降维、k值的优化选取和路径搜索方面均做出了重要改进,给出了k的取值原则和利用邻近节点信息确定最短路径的方法,有效避免了关键支路漏选且可大大减少分析计算量,实现了输电断面的快速识别,为预防电网连锁故障引发的级联跳闸奠定了基础。在新英格兰39节点和IEEE 118节点系统上进行了仿真分析,结果验证了该方法的正确性和有效性。

关 键 词:输电断面  割点  邻近节点  路径搜索  最短路径
收稿时间:6/8/2013 12:00:00 AM
修稿时间:2013/12/16 0:00:00

A Fast Recognition Method of Transmission Section Based on Cut-vertex and Path Search
MIAO Shihong,MA Shuai,SHANG Yanan,JIANG Zhen,HOU Junxian and YU Zhihong.A Fast Recognition Method of Transmission Section Based on Cut-vertex and Path Search[J].Automation of Electric Power Systems,2014,38(2):39-45.
Authors:MIAO Shihong  MA Shuai  SHANG Yanan  JIANG Zhen  HOU Junxian and YU Zhihong
Affiliation:State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, Wuhan 430074, China;State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, Wuhan 430074, China;State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, Wuhan 430074, China;State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, Wuhan 430074, China;China Electric Power Research Institute, Beijing 100192, China;China Electric Power Research Institute, Beijing 100192, China
Abstract:This paper proposes an intelligent recognition method of transmission section based on cut-vertex and path search. The transmission section is defined according to the characteristics of power flow transfer after the overload branch is cut. By drawing on the conceptions of cut-vertex, block and the shortest path possible in the graph theory, this paper presents an in-deep analysis on the topological characteristic of the transmission section. Through a series of matrix operations, the proposed method will find out the k shortest paths between two nodes of the overload line in a block with overload with the overload line as its center, and finally recognize the transmission section suffering the greatest harm from branch outage. Considerable improvement in power network model dimensionality reduction is reported, and optimal selection of k and path searching algorithm, the value of k and the shortest path determination are given, effectively avoiding omission of the key branch, greatly reducing the analysis computation workload, achieving rapid recognition of the transmission section, and laying a foundation for preventing cascading tripping due to grid faults. Simulation results of a New England 39-bus testing system and an IEEE 118-bus testing system show the correctness and validity of the method.
Keywords:transmission section  cut-vertex  neighboring node  path search  shortest paths
本文献已被 CNKI 等数据库收录!
点击此处可从《电力系统自动化》浏览原始摘要信息
点击此处可从《电力系统自动化》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号