电力系统保护与控制
電力繫統保護與控製
전력계통보호여공제
POWER SYSTM PROTECTION AND CONTROL
2015年
12期
8-13
,共6页
张富超%钟成元%张富春%刘耿华%黄家栋
張富超%鐘成元%張富春%劉耿華%黃傢棟
장부초%종성원%장부춘%류경화%황가동
源流路径%输电断面%快速搜索%潮流转移%开断分布因子
源流路徑%輸電斷麵%快速搜索%潮流轉移%開斷分佈因子
원류로경%수전단면%쾌속수색%조류전이%개단분포인자
paths between sources and flows%transmission section%fast search%power flow transferring%breaking distributed factors
过载支路切除引起大规模潮流转移是导致连锁故障的重要原因。为快速、准确和全面地搜索到受潮流转移影响较大的线路构成的输电断面,提出了一种基于源流路径剖分的输电断面快速搜索算法。该算法首先根据实际电网结构利用图论知识生成有向图,建立送端节点-送电支路邻接表,快速生成源流路径树,逐步搜索有效源流路径链,最后计算所有有效源流路径链中所包含支路的开断分布因子,识别出受潮流转移影响较大的线路。所提算法无需进行全网拓扑搜索,无大规模矩阵运算,因此算法简便,搜索快速。对 IEEE39节点系统进行仿真分析,其结果证明了所提算法的快速性与正确性。
過載支路切除引起大規模潮流轉移是導緻連鎖故障的重要原因。為快速、準確和全麵地搜索到受潮流轉移影響較大的線路構成的輸電斷麵,提齣瞭一種基于源流路徑剖分的輸電斷麵快速搜索算法。該算法首先根據實際電網結構利用圖論知識生成有嚮圖,建立送耑節點-送電支路鄰接錶,快速生成源流路徑樹,逐步搜索有效源流路徑鏈,最後計算所有有效源流路徑鏈中所包含支路的開斷分佈因子,識彆齣受潮流轉移影響較大的線路。所提算法無需進行全網拓撲搜索,無大規模矩陣運算,因此算法簡便,搜索快速。對 IEEE39節點繫統進行倣真分析,其結果證明瞭所提算法的快速性與正確性。
과재지로절제인기대규모조류전이시도치련쇄고장적중요원인。위쾌속、준학화전면지수색도수조류전이영향교대적선로구성적수전단면,제출료일충기우원류로경부분적수전단면쾌속수색산법。해산법수선근거실제전망결구이용도론지식생성유향도,건립송단절점-송전지로린접표,쾌속생성원류로경수,축보수색유효원류로경련,최후계산소유유효원류로경련중소포함지로적개단분포인자,식별출수조류전이영향교대적선로。소제산법무수진행전망탁복수색,무대규모구진운산,인차산법간편,수색쾌속。대 IEEE39절점계통진행방진분석,기결과증명료소제산법적쾌속성여정학성。
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.