论文标题
快速使用图形搜索技术快速识别饱和切割机
Fast Identification of Saturated Cut-sets using Graph Search Techniques
论文作者
论文摘要
当多次连续发生多次中断时，重要的是要快速知道电力网络的不同互连（或切割机）的功率传递能力是否受到限制。本文开发的算法非常快速地确定了这种有限的剪辑量，从而增强了对电力系统运营商的实时情况意识。使用IEEE 39-BUS测试系统描述了所提出的方法的重要性，而其计算益处则是使用包含数千辆总线的相对较大的测试案例来证明的。结果表明，所提出的网络分析可以估计停电对系统的任何切割集的影响，并屏幕筛选出最快的最大边距饱和的切割集。
When multiple outages occur in rapid succession, it is important to know quickly if the power transfer capability of different interconnections (or cut-sets) of the power network are limited. The algorithm developed in this paper identifies such limited cut-sets very fast, thereby enhancing the real-time situational awareness of power system operators. The significance of the proposed approach is described using the IEEE 39-bus test system, while its computational benefits are demonstrated using relatively large test-cases containing thousands of buses. The results indicate that the proposed network analysis can estimate the impact of an outage on any cut-set of the system and screen out the cut-set that gets saturated by the largest margin, very quickly.
