Visible to the public Contingency-Risk Informed Power System Design

TitleContingency-Risk Informed Power System Design
Publication TypeJournal Article
Year of Publication2014
AuthorsChen, R.L.-Y., Cohn, A., Neng Fan, Pinar, A.
JournalPower Systems, IEEE Transactions on
Date PublishedSept
Keywordscombinatorial explosion, contingency analysis problem, Contingency requirements, contingency-risk informed power system design, decomposition, electric power system, Electricity, generation expansion problem, IEEE 30-bus systems, IEEE 57-bus systems, implicit optimization, integer programming, Investment, Laboratories, long-term grid planning, minimum cost, mixed-integer programming formulation, N-k-ε survivability criterion, Planning, power system economics, power system reliability, Power systems, risk analysis, separation oracle, Standards, time 2 h, transmission expansion problem, Vectors

We consider the problem of designing (or augmenting) an electric power system at a minimum cost such that it satisfies the N-k-e survivability criterion. This survivability criterion is a generalization of the well-known N-k criterion, and it requires that at least (1-ej) fraction of the steady-state demand be met after failures of j components, for j=0,1,...,k. The network design problem adds another level of complexity to the notoriously hard contingency analysis problem, since the contingency analysis is only one of the requirements for the design optimization problem. We present a mixed-integer programming formulation of this problem that takes into account both transmission and generation expansion. We propose an algorithm that can avoid combinatorial explosion in the number of contingencies, by seeking vulnerabilities in intermediary solutions and constraining the design space accordingly. Our approach is built on our ability to identify such system vulnerabilities quickly. Our empirical studies on modified instances of the IEEE 30-bus and IEEE 57-bus systems show the effectiveness of our methods. We were able to solve the transmission and generation expansion problems for k=4 in approximately 30 min, while other approaches failed to provide a solution at the end of 2 h.

Citation Key6744681