提出了一种基于图论分析和路径搜索的关键支路识别方法。依据图论中割点、块和最短路径的概念,结合潮流转移分布系数和潮流冗余量,对受支路开断影响最严重的支路进行识别。对新英格兰10机39节点的算例分析表明:能克服以往识别关键支路的不完整性和仅采用潮流转移分布系数确定支路受影响程度的不足,将网络安全性分析的幅度由整个网络缩小到关键支路集内部支路,为潮流转移识别和减载控制策略减小了分析范围。同时提出了基于网络相关度系数和灵敏度的减载策略,该策略能在准确识别潮流转移基础上以最小的调整量快速消除过载,并保证其余支路不过载,算例分析验证了其可行性、正确性。

An identification method of key branch based on the theory of graph and path searches is proposed in this paper.By drawing on the conceptions of cut-vertex,block and the shortest path possible in the graph theory,with the distribution coefficient of Flow Transferring and flow redundancy,this paper identify the most affected branches because of breaking branches.The example analyses of 10-generator 39-bus New England System show that this method can overcome the incompleteness of identify key branch in the past and the insufficient of only using distribution factor determining the affected degree of the branches,The magnitude of network security analysis by the entire network down to the key branches within the set slip,reduced the scope of analysis for flow transferring identification and control strategies to load shedding.Proposed load shedding strategy based on network-related coefficient and sensitivity,this strategy can accurately identify the flow transferring and then use a minimum amount of adjustment quickly eliminate overload and ensure the remaining branches are not overloaded,a numerical example verifies the feasibility and correctness of the strategy.