Contingency-risk informed power system design

Richard Li Yang Chen, Amy Cohn, Neng Fan, Ali Pinar

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

We consider the problem of designing (or augmenting) an electric power system at a minimum cost such that it satisfies the N-k-survivability criterion. This survivability criterion is a generalization of the well-known N-k criterion, and it requires that at least 1-j 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.

Original languageEnglish (US)
Article number6744681
Pages (from-to)2087-2096
Number of pages10
JournalIEEE Transactions on Power Systems
Volume29
Issue number5
DOIs
StatePublished - 2014

Fingerprint

Systems analysis
Integer programming
Electric power systems
Explosions
Costs
Design optimization

Keywords

  • Contingency requirements
  • decomposition
  • implicit optimization
  • long-term grid planning
  • separation oracle

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Energy Engineering and Power Technology

Cite this

Contingency-risk informed power system design. / Chen, Richard Li Yang; Cohn, Amy; Fan, Neng; Pinar, Ali.

In: IEEE Transactions on Power Systems, Vol. 29, No. 5, 6744681, 2014, p. 2087-2096.

Research output: Contribution to journalArticle

Chen, Richard Li Yang ; Cohn, Amy ; Fan, Neng ; Pinar, Ali. / Contingency-risk informed power system design. In: IEEE Transactions on Power Systems. 2014 ; Vol. 29, No. 5. pp. 2087-2096.
@article{d2ab4ec4f1634e0f97d5b6d37fdc3cbc,
title = "Contingency-risk informed power system design",
abstract = "We consider the problem of designing (or augmenting) an electric power system at a minimum cost such that it satisfies the N-k-survivability criterion. This survivability criterion is a generalization of the well-known N-k criterion, and it requires that at least 1-j 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.",
keywords = "Contingency requirements, decomposition, implicit optimization, long-term grid planning, separation oracle",
author = "Chen, {Richard Li Yang} and Amy Cohn and Neng Fan and Ali Pinar",
year = "2014",
doi = "10.1109/TPWRS.2014.2301691",
language = "English (US)",
volume = "29",
pages = "2087--2096",
journal = "IEEE Transactions on Power Systems",
issn = "0885-8950",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Contingency-risk informed power system design

AU - Chen, Richard Li Yang

AU - Cohn, Amy

AU - Fan, Neng

AU - Pinar, Ali

PY - 2014

Y1 - 2014

N2 - We consider the problem of designing (or augmenting) an electric power system at a minimum cost such that it satisfies the N-k-survivability criterion. This survivability criterion is a generalization of the well-known N-k criterion, and it requires that at least 1-j 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.

AB - We consider the problem of designing (or augmenting) an electric power system at a minimum cost such that it satisfies the N-k-survivability criterion. This survivability criterion is a generalization of the well-known N-k criterion, and it requires that at least 1-j 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.

KW - Contingency requirements

KW - decomposition

KW - implicit optimization

KW - long-term grid planning

KW - separation oracle

UR - http://www.scopus.com/inward/record.url?scp=84906783858&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906783858&partnerID=8YFLogxK

U2 - 10.1109/TPWRS.2014.2301691

DO - 10.1109/TPWRS.2014.2301691

M3 - Article

VL - 29

SP - 2087

EP - 2096

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

SN - 0885-8950

IS - 5

M1 - 6744681

ER -