基于广度优先法的多支路连锁切除潮流转移快速搜索算法
A Fast Search Algorithm of Power Flow Transfer for Multi-branches Removal Event Based on Breadth First Search
-
摘要: 提出了有功转移系数的概念,利用直流潮流法推导了发生多线路连锁切除时的有功转移系数。当电力系统发生多线路连锁切除故障时,通过采用图论中的广度优先搜索算法,按层遍历与切除支路距离较近的各级线路并计算它们的有功转移系数,能够快速搜索出受潮流转移影响较大线路所构成的输电断面,并成功解决了对潮流反向增大线路漏选的问题,本算法不需要进行大量矩阵运算,也不需要对全网进行拓扑搜索。最后采用标准IEEE 30节点系统进行了仿真计算,验证了该算法的可行性和有效性。Abstract: The concept of active power transferring coefficient is put forward,with the active power transferring coefficient of multi-line resection derived via the calculating method of DC power flow.When excision of many lines happens,by using the breadth priority search algorithm in graph theory,all the lines are searched level by level.Meanwhile,their active power transferring coefficients are calculated to quickly search out the transmission section greatly influenced by power flow transferring,while solving the problem of leaving out the line whose power flow increases reversely.Neither large-scale matrix operation nor search of whole network topology is needed.Finally,an IEEE 30 node system simulation is analyzed that shows the feasibility and effectiveness of the algorithm.