Fast selection of N−2 contingencies for online security assessment
Fast selection of N−2 contingencies for online security assessment
复制标题
快速选择N−2个突发事件进行在线安全评估
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
K. Turitsyn
中科院分区：
文献类型：
--
作者：
P. Kaplunovich;K. Turitsyn
我们提出了一种新的算法选择与线路或发电机故障相关的危险N-2突发事件。该算法是基于所有可能的双重意外事件的集合的迭代过滤。它被证明可以识别所有危险的意外事件，并具有与N-1意外事件筛选相当的复杂性。波兰电网约3000总线的现实模型上进行的测试表明，只有两次迭代的算法允许一个证明99.9%的所有双重意外事件的安全性，只留下0.1%的最危险的直接分析。
We propose a novel algorithm for selection of dangerous N-2 contingencies associated with line or generator failures. The algorithm is based on iterative filtering of the set of all possible double contingencies. It is certified to identify all the dangerous contingencies, and has the complexity comparable to the N-1 contingency screening. Tests performed on realistic model of Polish power grid with about 3000 buses show that only two iterations of algorithm allow one to certify the safety of 99.9% of all double contingencies, leaving only 0.1% of the most dangerous ones for direct analysis.