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 all events that lead to thermal constraints violations in DC approximation. The complexity of the algorithm is O(N2) 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.

[1]  Benjamin A Carreras,et al.  Complex systems analysis of series of blackouts: cascading failure, critical points, and self-organization. , 2007, Chaos.

[2]  O. Alsaç,et al.  Analytical and computational improvements in performance-index ranking algorithms for networks , 1985 .

[3]  Thomas J. Overbye,et al.  Linear Analysis of Multiple Outage Interaction , 2009, 2009 42nd Hawaii International Conference on System Sciences.

[4]  B. Wollenberg,et al.  An Advanced Contingency Selection Algorithm , 1981, IEEE Transactions on Power Apparatus and Systems.

[5]  Paul Hines,et al.  A “Random Chemistry” Algorithm for Identifying Collections of Multiple Contingencies That Initiate Cascading Failure , 2012, IEEE Transactions on Power Systems.

[6]  Hiroyuki Mori,et al.  A tabu search based approach to (N-k) static contingency selection in power systems , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[7]  J.D. McCalley,et al.  Identifying high risk N-k contingencies for online security assessment , 2005, IEEE Transactions on Power Systems.

[8]  M. Enns,et al.  Fast Linear Contingency Analysis , 1982, IEEE Transactions on Power Apparatus and Systems.

[9]  G. Ejebe,et al.  Automatic Contingency Selection , 1979, IEEE Transactions on Power Apparatus and Systems.

[10]  P. Hines,et al.  Large blackouts in North America: Historical trends and policy implications , 2009 .

[11]  G. Gross,et al.  Detection of Island Formation and Identification of Causal Factors Under Multiple Line Outages , 2007, IEEE Transactions on Power Systems.

[12]  M. Y. Vaiman,et al.  Prevention of cascading outages in Con Edison's network , 2010, IEEE PES T&D 2010.

[13]  Janghoon Kim,et al.  Testing Branching Process Estimators of Cascading Failure with Data from a Simulation of Transmission Line Outages , 2010, Risk analysis : an official publication of the Society for Risk Analysis.

[14]  Mark K. Enns,et al.  Fast Linear Contingency Analysis , 1982 .

[15]  G. C. Ejebe,et al.  Fast contingency screening and evaluation for voltage security analysis , 1988 .

[16]  Byongjun Lee,et al.  Network centrality based N-k contingency scenario generation , 2009, 2009 Transmission & Distribution Conference & Exposition: Asia and Pacific.

[17]  Chao Yang,et al.  Severe Multiple Contingency Screening in Electric Power Systems , 2008, IEEE Transactions on Power Systems.

[18]  T. J. Overbye,et al.  Multiple Element Contingency Screening , 2011, IEEE Transactions on Power Systems.

[19]  P. Hines,et al.  Cascading failures in power grids , 2009, IEEE Potentials.

[20]  R D Zimmerman,et al.  MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.

[21]  G. Irisarri,et al.  An Automatic Contingency Selection Method for On-Line Security Analysis , 1981, IEEE Transactions on Power Apparatus and Systems.

[22]  Margaret J. Eppstein,et al.  A "Random Chemistry" Algorithm for Identifying Multiple Contingencies that Initiate Cascading Failure , 2012 .