skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Probabilistic N-k failure-identification for power systems

Journal Article · · Networks
DOI:https://doi.org/10.1002/net.21806· OSTI ID:1463479

This work considers a probabilistic generalization of the N-k failure-identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of k components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the k components. The resulting problem is formulated as a bilevel mixed-integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting-plane algorithm is proposed to solve the convex relaxation and linear approximations of the N-k problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small-, medium-, and large-scale test instances; the test instances include the IEEE 14-bus system, the IEEE single-area and three-area RTS96 systems, the IEEE 118-bus system, the WECC 240-bus test system, the 1354-bus PEGASE system, and the 2383-bus Polish winter-peak test system.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE Laboratory Directed Research and Development (LDRD) Program
Grant/Contract Number:
AC52-06NA25396
OSTI ID:
1463479
Report Number(s):
LA-UR-17-23601
Journal Information:
Networks, Vol. 71, Issue 3; ISSN 0028-3045
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 15 works
Citation information provided by
Web of Science

References (37)

Bilevel programming applied to power system vulnerability analysis under multiple contingencies journal January 2010
Radial Distribution Load Flow Using Conic Programming journal August 2006
The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow journal July 2016
A Mixed-Integer LP Procedure for the Analysis of Electric Grid Security Under Disruptive Threat journal August 2005
Reformulation and sampling to solve a stochastic network interdiction problem journal October 2008
Convex quadratic relaxations for mixed-integer nonlinear programs in power systems journal October 2016
Application of a genetic algorithm to n-K power system security assessment journal July 2013
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid journal January 2010
Analysis of Electric Grid Interdiction With Line Switching journal May 2010
Multiple Element Contingency Screening journal August 2011
Shortest-path network interdiction journal August 2002
Bound Tightening for the Alternating Current Optimal Power Flow Problem journal September 2016
Analyzing Vulnerability of Power Systems with Continuous Optimization Formulations journal July 2016
Semidefinite programming for optimal power flow problems journal July 2008
The IEEE Reliability Test System-1996. A report prepared by the Reliability Test System Task Force of the Application of Probability Methods Subcommittee journal January 1999
Fast Linear Contingency Analysis journal April 1982
Severe Multiple Contingency Screening in Electric Power Systems journal May 2008
AC-Feasibility on Tree Networks is NP-Hard journal January 2016
Methodology for identifying near-optimal interdiction strategies for a power transmission system journal September 2007
Stochastic Network Interdiction journal April 1998
A unified network performance measure with importance identification and the ranking of network components journal May 2007
On the Solution of the Bilevel Programming Formulation of the Terrorist Threat Problem journal May 2005
The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments journal January 2010
A “Random Chemistry” Algorithm for Identifying Collections of Multiple Contingencies That Initiate Cascading Failure journal August 2012
Defending Critical Infrastructure journal December 2006
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming journal April 2005
PowerModels. JL: An Open-Source Framework for Exploring Power Flow Formulations conference June 2018
Primal and dual bounds for Optimal Transmission Switching conference August 2014
Moment-based relaxation of the optimal power flow problem conference August 2014
Quantifying the effect of k-line failures in power grids conference July 2016
Fast Linear Contingency Analysis journal April 1982
Analysis of electric grid interdiction with line switching conference July 2010
The QC relaxation: A theoretical and computational study on optimal power flow conference July 2017
AC-Feasibility on Tree Networks is NP-Hard preprint January 2014
PowerModels.jl: An Open-Source Framework for Exploring Power Flow Formulations preprint January 2017
Analysis of Electric Grid Security Under Terrorist Threat journal May 2004
Worst-Case Interdiction Analysis of Large-Scale Electric Power Grids journal February 2009