Towards Efficient N-x Contingency Selection Using Group betweenness Centrality

The goal of N - x contingency selection is to pick a subset of critical cases to assess their potential to initiate a severe crippling of an electric power grid. Even for a moderate-sized system there can be an overwhelmingly large number of contingency cases that need to be studied. The number grows exponentially with x. This combinatorial explosion renders any exhaustive search strategy computationally infeasible, even for small to medium sized systems. We propose a novel method for N - x contingency selection for x ≥ 2 using group betweenness centrality and show that computation can be relatively decoupled from the problem size. Thus, making contingency analysis feasible for large systems with x ≥ 2. Consequently, it may be that N - x (for x ≥ 2) contingency selection can be effectively deployed despite the combinatorial explosion of the number of potential N - x contingencies.

[1]  Zhenyu Huang,et al.  Massive contingency analysis with high performance computing , 2009, 2009 IEEE Power & Energy Society General Meeting.

[2]  Fei Xue,et al.  Assessment of Structural Vulnerability for Power Grids by Network Performance Based on Complex Networks , 2009, CRITIS.

[3]  Juan C. Meza,et al.  Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid , 2010, SIAM J. Optim..

[4]  Rami Puzis,et al.  Routing betweenness centrality , 2010, JACM.

[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]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[7]  Christian Posse,et al.  Evaluating North American Electric Grid Reliability Using the Barabasi-Albert Network Model , 2004, nlin/0408052.

[8]  Pak Chung Wong,et al.  A novel application of parallel betweenness centrality to power grid contingency analysis , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[9]  P. Hines,et al.  Do topological models provide good information about electricity infrastructure vulnerability? , 2010, Chaos.

[10]  Margaret J. Eppstein,et al.  A “Random Chemistry” algorithm for identifying collections of multiple contingencies that initiate cascading failure , 2013, PES 2013.

[11]  John Zaborszky,et al.  Fast Contingency Evaluation Using Concentric Relaxation , 1980, IEEE Transactions on Power Apparatus and Systems.

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

[13]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[14]  Rami Puzis,et al.  Fast algorithm for successive computation of group betweenness centrality. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Juan Li,et al.  Analysis, control, and economic impact assessment of major blackout events , 2008 .

[16]  Rami Puzis,et al.  Finding the most prominent group in complex networks , 2007, AI Commun..

[17]  Rami Puzis,et al.  Incremental deployment of network monitors based on Group Betweenness Centrality , 2009, Inf. Process. Lett..

[18]  Erwan Le Merrer,et al.  Centralities: capturing the fuzzy notion of importance in social graphs , 2009, SNS '09.

[19]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[20]  Sun Wook Kang,et al.  Contingency selection via quadratized power flow sensitivity analysis , 2002, IEEE Power Engineering Society Summer Meeting,.

[21]  Seth Blumsack,et al.  A Centrality Measure for Electrical Networks , 2008, Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008).

[22]  Zhenyu Huang,et al.  Techniques for Improving Filters in Power Grid Contingency Analysis , 2011, MLDM.

[23]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[24]  Vladimir Brandwajn,et al.  Partial Matrix Refactorization , 1986, IEEE Transactions on Power Systems.

[25]  Daniel Bienstock,et al.  The N-k Problem in Power Grids: New Models, Formulations, and Numerical Experiments , 2009, SIAM J. Optim..

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

[27]  W. F. Tinney,et al.  Sparse Vector Methods , 1985, IEEE Transactions on Power Apparatus and Systems.

[28]  V. Brandwajn,et al.  Complete Bounding Method for AC Contingency Screening , 1989, IEEE Power Engineering Review.

[29]  Aidong Zhang,et al.  Bridging centrality: graph mining from element level to group level , 2008, KDD.

[30]  S. Borgatti,et al.  The centrality of groups and classes , 1999 .

[31]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[32]  Ulrik Brandes,et al.  Centrality Measures Based on Current Flow , 2005, STACS.

[33]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[34]  Probability Subcommittee,et al.  IEEE Reliability Test System , 1979, IEEE Transactions on Power Apparatus and Systems.