|
| 引用本文: | 张富超,钟成元,张富春,刘耿华,黄家栋.基于源流路径剖分的输电断面快速搜索[J].电力系统保护与控制,2015,43(12):8-13.[点击复制] |
| ZHANG Fuchao,ZHONG Chengyuan,ZHANG Fuchun,LIU Genghua,HUANG Jiadong.Fast search of transmission section based on path split between sources and flows[J].Power System Protection and Control,2015,43(12):8-13[点击复制] |
|
| |
|
|
| 本文已被：浏览 5639次 下载 2421次 |
码上扫一扫！ |
| 基于源流路径剖分的输电断面快速搜索 |
| 张富超,钟成元,张富春,刘耿华,黄家栋 |
|
|
| (华北电力大学电气与电子工程学院，河北 保定 071003;国网安庆供电公司，安徽 安庆 246003;国网冀北电力有限公司秦皇岛供电公司，河北 秦皇岛 066000;吉林电力培训中心，吉林 长春 130062) |
|
| 摘要: |
| 过载支路切除引起大规模潮流转移是导致连锁故障的重要原因。为快速、准确和全面地搜索到受潮流转移影响较大的线路构成的输电断面，提出了一种基于源流路径剖分的输电断面快速搜索算法。该算法首先根据实际电网结构利用图论知识生成有向图，建立送端节点-送电支路邻接表，快速生成源流路径树，逐步搜索有效源流路径链，最后计算所有有效源流路径链中所包含支路的开断分布因子，识别出受潮流转移影响较大的线路。所提算法无需进行全网拓扑搜索，无大规模矩阵运算，因此算法简便，搜索快速。对IEEE39节点系统进行仿真分析，其结果证明了所提算法的快速性与正确性。 |
| 关键词: 源流路径 输电断面 快速搜索 潮流转移 开断分布因子 |
| DOI：10.7667/j.issn.1674-3415.2015.12.002 |
| 投稿时间：2014-09-12修订日期：2014-10-29 |
| 基金项目: |
|
| Fast search of transmission section based on path split between sources and flows |
| ZHANG Fuchao,ZHONG Chengyuan,ZHANG Fuchun,LIU Genghua,HUANG Jiadong |
| (School of Electrical and Electronic Engineering, North China Electric Power University, Baoding 071003, China;State Grid Anqing Electric Power Company, Anqing 246003, China;State Grid Qinhuangdao Electric Power
Company, Qinhuangdao 066000, China;Jilin Electric Power Training Center, Changchun 130062, China) |
| Abstract: |
| Large-scale power flow transferring caused by overload lines removal is an important reason for cascading overload trips. For obtaining transmission section consisting of the lines that affected largely by the power flow transferring, this paper proposes a fast search algorithm about transmission section based on path split between sources and flows. Firstly, the algorithm transforms the actual grid structure into a directed graph using graph theory, then establishes the sending end node-power transmission branch adjacent table and quickly generates path trees of sources and flows. Breaking distributed factors of the branches included in all the effective path chains between sources and flows are calculated. The lines that largely affected by the power flow transferring are identified. This algorithm needn’t search for entire network topology and doesn’t contain any large mass matrix operations, so it is efficient. Finally, the simulation results of IEEE 39 nodes prove the rapidity and correctness of the algorithm. |
| Key words: paths between sources and flows transmission section fast search power flow transferring breaking distributed factors |
|
|
|
|
|
