Bilevel programming applied to power system vulnerability analysis under multiple contingencies

Arroyo, José M.

doi:10.1049/iet-gtd.2009.0098

Cited by 207 publications

(149 citation statements)

References 27 publications

Supporting

Mentioning

138

Contrasting

Unclassified

Order By: Relevance

“…Of specific relevance to our work is the literature on security-constrained optimal power flow in situations where large numbers of system components fail. This literature is mostly based on worstcase network interdiction analysis and includes solution methods based on bi-level and mixed-integer programming (see [24,25,1,8,33,32]) and graph algorithms (see [22,3,8,15,16]). …”

mentioning

confidence: 99%

Contingency-constrained unit commitment with post-contingency corrective recourse

et al. 2014

View full text Add to dashboard Cite

We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an N-k-ε reliability criterion. This reliability criterion is a generalization of the wellknown N-k criterion, and dictates that at least (1 − ε j ) fraction of the total system demand must be met following the failures of k or fewer system components. We refer to this problem as the Contingency-Constrained Unit Commitment problem, or CCUC. We present a mixed-integer programming formulation of the CCUC that accounts for both transmission and generation element failures. We propose novel cutting plane algorithms that avoid the need to explicitly consider an exponential number of contingencies. Computational studies are performed on several IEEE test systems and a simplified model of the Western US interconnection network, which demonstrate the effectiveness of our proposed methods relative to current state-of-the-art.

show abstract

mentioning

confidence: 99%

Contingency-constrained unit commitment with post-contingency corrective recourse

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Within this paradigm, an attacker marshals their available resources to cause maximum damage, while simultaneously the system operator proactively uses their resources to minimize the impact of an attack (for instance, by post-attack generator redispatch or line switching.) The work of Arroyo implemented this model as a bilevel optimization problem in [95], with his subsequent work elucidating further refinements to such a formulation [96]- [99]. Others have also made important contributions to the multilevel modelling of power system attack and defence games [100]- [102]: some contributions additionally consider optimal pre-emptive defensive hardening of certain components [99], [103], [104].…”

Section: F Multilevel Attacker/defender Formulationsmentioning

confidence: 99%

A Comparison of Malicious Interdiction Strategies Against Electrical Networks

Cuffe

2017

IEEE J. Emerg. Sel. Topics Circuits Syst.

View full text Add to dashboard Cite

“…The linear BP has been applied to a large variety of problems, e.g., worst overloads [2], [5], terrorist threats [13], [14], worst-case interdictions [15], vulnerability analysis under multiple contingencies [16], contingency-constrained unit commitment [17], etc. Most of these approaches reformulate the lower-level problem by means of Karush-Kuhn-Tucker optimality conditions, leading to a MPEC single level optimization, and further transform the problem into a more tractable MILP, except for [16] which uses results from duality theory and [17] which uses robust optimization techniques.…”

mentioning

confidence: 99%

“…Most of these approaches reformulate the lower-level problem by means of Karush-Kuhn-Tucker optimality conditions, leading to a MPEC single level optimization, and further transform the problem into a more tractable MILP, except for [16] which uses results from duality theory and [17] which uses robust optimization techniques.…”

mentioning

confidence: 99%

Computation of Worst Operation Scenarios Under Uncertainty for Static Security Management

Capitanescu

Wehenkel

2013

IEEE Trans. Power Syst.

View full text Add to dashboard Cite

Abstract-This paper deals with day-ahead static security assessment with respect to a postulated set of contingencies while taking into account uncertainties about the next day system conditions. We propose a heuristic approach to compute the worst-case under operation uncertainty for a contingency with respect to overloads. We formulate this problem as a non-convex nonlinear bilevel program that we solve approximately by a heuristic approach which relies on the solution of successive optimal power flow (OPF) and security-constrained optimal power flow (SCOPF) problems of a special type. The method aims at revealing those combinations of uncertainties and contingencies for which the best combination of preventive and corrective actions would not suffice to ensure security. Extensive numerical results on a small, a medium, and a very large system prove the interest of the approach.Index Terms-Bilevel programming, operation under uncertainty, optimal power flow, security-constrained optimal power flow, worst-case analysis. NOMENCLATUREIn the paper vectors are written using bold characters. A. SetsSet of power flow equations in pre-contingency state. Set of power flow equations after contingency .Set of operating limits in pre-contingency state.Set of operating limits after contingency .Set of postulated contingencies.Set of violated constraints.Set of problematic constraints.Union of all sets of problematic constraints.Set of problematic patterns.

show abstract

Bilevel programming applied to power system vulnerability analysis under multiple contingencies

Cited by 207 publications

References 27 publications

Contingency-constrained unit commitment with post-contingency corrective recourse

Contingency-constrained unit commitment with post-contingency corrective recourse

A Comparison of Malicious Interdiction Strategies Against Electrical Networks

Computation of Worst Operation Scenarios Under Uncertainty for Static Security Management

Contact Info

Product

Resources

About