中国电机工程学报
中國電機工程學報
중국전궤공정학보
ZHONGGUO DIANJI GONGCHENG XUEBAO
2012年
13期
86-94
,共9页
林济铿%李胜文%吴鹏%王旭东%邵广惠%徐兴伟%马新
林濟鏗%李勝文%吳鵬%王旭東%邵廣惠%徐興偉%馬新
림제갱%리성문%오붕%왕욱동%소엄혜%서흥위%마신
电力系统最优主动解列%2阶段求解方法%含连通%图约束的背包问题%图的最优平衡分割问题%调节问题
電力繫統最優主動解列%2階段求解方法%含連通%圖約束的揹包問題%圖的最優平衡分割問題%調節問題
전력계통최우주동해렬%2계단구해방법%함련통%도약속적배포문제%도적최우평형분할문제%조절문제
optimal controlled partition of power systems%two-stage strategy%connected graph constrained knapsack problem (CGKP)%optimal graph balance partition problem%regulation problem
解列是电力系统在故障时结构完整性得不到保证的情况下分裂为2个或多个孤立稳定运行子系统的过程或操作。及时恰当的主动解列操作将能有效地避免因保护连锁动作使得电力系统被动解列而崩溃所造成的巨额经济损失。结合图论中的相关概念和输电网最优解列的物理过程,建立电力系统最优主动解列断面选择问题的完整数学模型,并基于含连通图约束的背包问题(connected graph constrained knapsack problem,CGKP)及其求解算法提出“搜索+调整”的2阶段求解方法。为降低问题的复杂性,将完整数学模型分解成图的最优平衡分割问题和基于优化潮流的调节问题,并分2个阶段分别求解。其中,图的最优平衡分割问题又被分解成多个CGKP,利用基于含CGKP的图分割方法进行求解。所提出的主动解列策略具有较强理论基础,计算复杂度低,算例的计算结果证明了该模型及算法的正确性和有效性。
解列是電力繫統在故障時結構完整性得不到保證的情況下分裂為2箇或多箇孤立穩定運行子繫統的過程或操作。及時恰噹的主動解列操作將能有效地避免因保護連鎖動作使得電力繫統被動解列而崩潰所造成的巨額經濟損失。結閤圖論中的相關概唸和輸電網最優解列的物理過程,建立電力繫統最優主動解列斷麵選擇問題的完整數學模型,併基于含連通圖約束的揹包問題(connected graph constrained knapsack problem,CGKP)及其求解算法提齣“搜索+調整”的2階段求解方法。為降低問題的複雜性,將完整數學模型分解成圖的最優平衡分割問題和基于優化潮流的調節問題,併分2箇階段分彆求解。其中,圖的最優平衡分割問題又被分解成多箇CGKP,利用基于含CGKP的圖分割方法進行求解。所提齣的主動解列策略具有較彊理論基礎,計算複雜度低,算例的計算結果證明瞭該模型及算法的正確性和有效性。
해렬시전력계통재고장시결구완정성득불도보증적정황하분렬위2개혹다개고립은정운행자계통적과정혹조작。급시흡당적주동해렬조작장능유효지피면인보호련쇄동작사득전력계통피동해렬이붕궤소조성적거액경제손실。결합도론중적상관개념화수전망최우해렬적물리과정,건립전력계통최우주동해렬단면선택문제적완정수학모형,병기우함련통도약속적배포문제(connected graph constrained knapsack problem,CGKP)급기구해산법제출“수색+조정”적2계단구해방법。위강저문제적복잡성,장완정수학모형분해성도적최우평형분할문제화기우우화조류적조절문제,병분2개계단분별구해。기중,도적최우평형분할문제우피분해성다개CGKP,이용기우함CGKP적도분할방법진행구해。소제출적주동해렬책략구유교강이론기출,계산복잡도저,산례적계산결과증명료해모형급산법적정학성화유효성。
Power system partitioning is to split interconnected grid into two or more stable subsystems when the structure of power systems can not be hold. Based on the related graph theory notions and the practical physical process, the complete model for optimal controlled partitioning of power systems which synthetically considers all kinds of security constraints was constructed, and a two-stage strategy-"searching and regulation" based on connected graph constrained knapsack problem (CGKP) was designed to solve this model. In order to reduce the computation complexity, the model was decomposed into an optimal balance graph partition problem and a regulation problem based on optimal power flow, both of which were solved successively in two stages. The optimal graph balance partition problem was further decomposed into multiple CGKPs, which were solved by the graph partitioning method based on CGKP. The algorithm proposed owns the advantages of strong theoretical foundation and low computational complexity. Results of samples demonstrate that the model and algorithm proposed are valid.