Fast Algorithm for N-2 Contingency Problem
We present a novel selection algorithm for N-2 contingency analysis problem. The algorithm is based on the iterative bounding of line outage distribution factors and successive pruning of the set of contingency pair candidates. The selection procedure is non-heuristic, and is certified to identify a...
Main Authors: | Turitsyn, Konstantin, Kaplunovich, P. A. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mechanical Engineering |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2015
|
Online Access: | http://hdl.handle.net/1721.1/97731 https://orcid.org/0000-0002-7997-8962 |
Similar Items
-
Fast selection of N-2 contingencies for online security assessment
by: Kaplunovich, P. A., et al.
Published: (2015) -
Efficient algorithm for online N - 2 power grid contingency selection
by: Kaplunovich, Petr A. (Petr Alexandrovich)
Published: (2014) -
Transversality enforced Newton–Raphson algorithm for fast calculation of maximum loadability
by: Ali, Mazhar, et al.
Published: (2024) -
The contingency problem for neo-conventionalism
by: Livingstone-Banks, J
Published: (2016) -
Evaluating machine learning models for the fast identification of contingency cases
by: Florian Schäfer, et al.
Published: (2020-12-01)