Fast Algorithm for N-2 Contingency Problem
Name
Turitsyn_Fast algorithm.pdf
Size
109.96 KB
Format
Adobe PDF
Checksum (MD5)
2de900014606879dc9500b6fd650e116
Author(s)
Turitsyn, Konstantin
Kaplunovich, P. A.
Date Issued
January 2013
Journal
Proceedings of the 2013 46th Hawaii International Conference on System Sciences
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Turitsyn, K.S., and P.A. Kaplunovich. “Fast Algorithm for N-2 Contingency Problem.” 2013 46th Hawaii International Conference on System Sciences (January 2013).
Version
Original manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/HICSS.2013.233
