电力系统自动化
電力繫統自動化
전력계통자동화
AUTOMATION OF ELECTRIC POWER SYSTEMS
2014年
10期
71-77
,共7页
张旭%程雪婷%赵冬梅%苏玲
張旭%程雪婷%趙鼕梅%囌玲
장욱%정설정%조동매%소령
电网拓扑%故障恢复%路径搜索%多路径
電網拓撲%故障恢複%路徑搜索%多路徑
전망탁복%고장회복%로경수색%다로경
power grid topology%fault restoration%path search%multiple paths
恢复路径搜索是故障恢复的基础,快速完备的路径搜索方法对于保障在线恢复系统的实用性具有重要意义。以快速搜索多路径为目标,提出一种基于顶点分裂的路径搜索方法,根据电网拓扑关系,将电网等值为子系统—开关刀闸模型,映射为顶点—边。结合顶点的连接关系,构建连接矩阵,计算顶点的度,引入顶点状态属性。根据度和属性的不同,分别对顶点进行删除、消减及分裂,完成从顶点到路径的转换;针对复杂网络,可设置路径约束条件,删除分裂所得的长路径,实现多路径的快速搜索。根据待恢复负荷数量的差异,采用不同方法生成恢复方案。使用实际电网的恢复算例验证了方法的有效性,并与宽度优先搜索、遗传算法进行对比分析,结果表明,该方法网络适应性好,易于实现,能够快速搜索多条供电路径,对在线恢复系统的实时运行具有重要价值。
恢複路徑搜索是故障恢複的基礎,快速完備的路徑搜索方法對于保障在線恢複繫統的實用性具有重要意義。以快速搜索多路徑為目標,提齣一種基于頂點分裂的路徑搜索方法,根據電網拓撲關繫,將電網等值為子繫統—開關刀閘模型,映射為頂點—邊。結閤頂點的連接關繫,構建連接矩陣,計算頂點的度,引入頂點狀態屬性。根據度和屬性的不同,分彆對頂點進行刪除、消減及分裂,完成從頂點到路徑的轉換;針對複雜網絡,可設置路徑約束條件,刪除分裂所得的長路徑,實現多路徑的快速搜索。根據待恢複負荷數量的差異,採用不同方法生成恢複方案。使用實際電網的恢複算例驗證瞭方法的有效性,併與寬度優先搜索、遺傳算法進行對比分析,結果錶明,該方法網絡適應性好,易于實現,能夠快速搜索多條供電路徑,對在線恢複繫統的實時運行具有重要價值。
회복로경수색시고장회복적기출,쾌속완비적로경수색방법대우보장재선회복계통적실용성구유중요의의。이쾌속수색다로경위목표,제출일충기우정점분렬적로경수색방법,근거전망탁복관계,장전망등치위자계통—개관도갑모형,영사위정점—변。결합정점적련접관계,구건련접구진,계산정점적도,인입정점상태속성。근거도화속성적불동,분별대정점진행산제、소감급분렬,완성종정점도로경적전환;침대복잡망락,가설치로경약속조건,산제분렬소득적장로경,실현다로경적쾌속수색。근거대회복부하수량적차이,채용불동방법생성회복방안。사용실제전망적회복산례험증료방법적유효성,병여관도우선수색、유전산법진행대비분석,결과표명,해방법망락괄응성호,역우실현,능구쾌속수색다조공전로경,대재선회복계통적실시운행구유중요개치。
Path search is the basis of fault restoration for the power grid that plays an important role in ensuring the effectiveness and practicability of the recovery system to search the effective paths quickly and completely.Aiming for rapidly searching multiple paths,a search strategy based on vertex splitting is proposed.The power grid is equivalent to a subsystem-switch model based on the topological relation.By making use of the graph theory,the equivalent model is mapped to a vertex-side model.On the above basis,construct the connection matrix and calculate the degree of the vertices,combined with the connectivity of the vertexes.According to the different degrees,adopt the vertex deleting,eliminating,splitting strategy;in consideration of the complex network,setting the path constraints and deleting the long paths to realize the recovery way search.Based on the number of outaged load vertices,take different methods to solve the recovery scheme.The effectiveness of the algorithm is demonstrated by an actual calculation.Compared with breadth first search and genetic algorithm (GA),the results show that the proposed algorithm able to solve several paths and improve the calculation efficiency is suitable for different complicated networks and feasible in online restoration of system real-time operation.