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: | , |
|---|---|
| Other Authors: | |
| 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 |
| _version_ | 1811069671740276736 |
|---|---|
| author | Turitsyn, Konstantin Kaplunovich, P. A. |
| author2 | Massachusetts Institute of Technology. Department of Mechanical Engineering |
| author_facet | Massachusetts Institute of Technology. Department of Mechanical Engineering Turitsyn, Konstantin Kaplunovich, P. A. |
| author_sort | Turitsyn, Konstantin |
| collection | MIT |
| description | 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 all events that lead to thermal constraints violations in DC approximation. The complexity of the algorithm is O(N[superscript 2]) comparable to the complexity of N-1 contingency problem. We validate and test the algorithm on the Polish grid network with around 3000 lines. For this test case two iterations of the pruning procedure reduce the total number of candidate pairs by a factor of almost 1000 from 5 millions line pairs to only 6128. |
| first_indexed | 2024-09-23T08:14:04Z |
| format | Article |
| id | mit-1721.1/97731 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:14:04Z |
| publishDate | 2015 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/977312022-09-23T11:47:09Z Fast Algorithm for N-2 Contingency Problem Turitsyn, Konstantin Kaplunovich, P. A. Massachusetts Institute of Technology. Department of Mechanical Engineering Turitsyn, Konstantin Kaplunovich, P. A. 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 all events that lead to thermal constraints violations in DC approximation. The complexity of the algorithm is O(N[superscript 2]) comparable to the complexity of N-1 contingency problem. We validate and test the algorithm on the Polish grid network with around 3000 lines. For this test case two iterations of the pruning procedure reduce the total number of candidate pairs by a factor of almost 1000 from 5 millions line pairs to only 6128. National Science Foundation (U.S.) (Award ECCS-1128437) MIT Skoltech Initiative (Seed Funding Grant) Russian Government Contract (11.519.11.6018) 2015-07-13T18:37:31Z 2015-07-13T18:37:31Z 2013-01 Article http://purl.org/eprint/type/ConferencePaper 978-1-4673-5933-7 978-0-7695-4892-0 1530-1605 http://hdl.handle.net/1721.1/97731 Turitsyn, K.S., and P.A. Kaplunovich. “Fast Algorithm for N-2 Contingency Problem.” 2013 46th Hawaii International Conference on System Sciences (January 2013). https://orcid.org/0000-0002-7997-8962 en_US http://dx.doi.org/10.1109/HICSS.2013.233 Proceedings of the 2013 46th Hawaii International Conference on System Sciences Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
| spellingShingle | Turitsyn, Konstantin Kaplunovich, P. A. Fast Algorithm for N-2 Contingency Problem |
| title | Fast Algorithm for N-2 Contingency Problem |
| title_full | Fast Algorithm for N-2 Contingency Problem |
| title_fullStr | Fast Algorithm for N-2 Contingency Problem |
| title_full_unstemmed | Fast Algorithm for N-2 Contingency Problem |
| title_short | Fast Algorithm for N-2 Contingency Problem |
| title_sort | fast algorithm for n 2 contingency problem |
| url | http://hdl.handle.net/1721.1/97731 https://orcid.org/0000-0002-7997-8962 |
| work_keys_str_mv | AT turitsynkonstantin fastalgorithmforn2contingencyproblem AT kaplunovichpa fastalgorithmforn2contingencyproblem |