Heuristics-based approach for identifying critical N — k contingencies in power systems
Heuristics-based approach for identifying critical N — k contingencies in power systems
复制标题
基于启发式的方法来识别电力系统中的关键 Nk 突发事件
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
X. Koutsoukos
中科院分区：
文献类型：
--
作者：
Saqib Hasan;Amin Ghafouri;A. Dubey;G. Karsai;X. Koutsoukos
电力系统在存在多个临界N-k故障的情况下可靠运行是系统操作员面临的一个重要挑战。由于搜索空间的组合爆炸，识别所有可能的N-k临界偶发事件来设计有效的缓解策略在计算上是不可行的。本文提出了两种基于候选列联集迭代剪枝的启发式算法，以有效和高效地识别导致系统故障的所有关键N-k个意外事件。将这些算法应用于标准IEEE-14节点系统、IEEE-39节点系统和IEEE-57节点系统，以识别多个关键N-k故障。该算法能够捕获所有可能的关键N-k偶发事件(其中1≤k≤9)而不会遗漏任何危险的偶发事件。
Reliable operation of electrical power systems in the presence of multiple critical N — k contingencies is an important challenge for the system operators. Identifying all the possible N — k critical contingencies to design effective mitigation strategies is computationally infeasible due to the combinatorial explosion of the search space. This paper describes two heuristic algorithms based on the iterative pruning of the candidate contingency set to effectively and efficiently identify all the critical N — k contingencies resulting in system failure. These algorithms are applied to the standard IEEE-14 bus system, IEEE-39 bus system, and IEEE-57 bus system to identify multiple critical N — k contingencies. The algorithms are able to capture all the possible critical N — k contingencies (where 1 ≤ k ≤ 9) without missing any dangerous contingency.