| dc.contributor |
Massachusetts Institute of Technology. Department of Mechanical Engineering |
|
| dc.contributor |
Turitsyn, Konstantin |
|
| dc.contributor |
Kaplunovich, P. A. |
|
| dc.creator |
Turitsyn, Konstantin |
|
| dc.creator |
Kaplunovich, P. A. |
|
| dc.date |
2015-07-13T18:37:31Z |
|
| dc.date |
2015-07-13T18:37:31Z |
|
| dc.date |
2013-01 |
|
| dc.date.accessioned |
2023-03-01T18:05:49Z |
|
| dc.date.available |
2023-03-01T18:05:49Z |
|
| dc.identifier |
978-1-4673-5933-7 |
|
| dc.identifier |
978-0-7695-4892-0 |
|
| dc.identifier |
1530-1605 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/97731 |
|
| dc.identifier |
Turitsyn, K.S., and P.A. Kaplunovich. “Fast Algorithm for N-2 Contingency Problem.” 2013 46th Hawaii International Conference on System Sciences (January 2013). |
|
| dc.identifier |
https://orcid.org/0000-0002-7997-8962 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/278732 |
|
| dc.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. |
|
| dc.description |
National Science Foundation (U.S.) (Award ECCS-1128437) |
|
| dc.description |
MIT Skoltech Initiative (Seed Funding Grant) |
|
| dc.description |
Russian Government Contract (11.519.11.6018) |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Institute of Electrical and Electronics Engineers (IEEE) |
|
| dc.relation |
http://dx.doi.org/10.1109/HICSS.2013.233 |
|
| dc.relation |
Proceedings of the 2013 46th Hawaii International Conference on System Sciences |
|
| dc.rights |
Creative Commons Attribution-Noncommercial-Share Alike |
|
| dc.rights |
http://creativecommons.org/licenses/by-nc-sa/4.0/ |
|
| dc.source |
arXiv |
|
| dc.title |
Fast Algorithm for N-2 Contingency Problem |
|
| dc.type |
Article |
|
| dc.type |
http://purl.org/eprint/type/ConferencePaper |
|