Algorithm for the N -2 Security-Constrained Unit Commitment Problem with Transmission Switching

Kathryn M. Schumacher (), Amy E. M. Cohn () and Richard Li-Yang Chen ()
Additional contact information
Kathryn M. Schumacher: Operations Research, Research and Development, General Motors, Warren, Michigan 48092
Amy E. M. Cohn: Industrial and Operations Engineering Department, University of Michigan, Ann Arbor, Michigan 48109
Richard Li-Yang Chen: Industrial and Operations Engineering Department, University of Michigan, Ann Arbor, Michigan 48109; and Quantitative Modeling and Analysis, Sandia National Laboratories, Livermore, California 94551

INFORMS Journal on Computing, 2017, vol. 29, issue 4, 645-659

Abstract: Most power grid systems are operated to be N -1 secure, meaning that the system can withstand the failure of any one component. There is increasing interest in more stringent security standards, where the power grid must be able to survive the (nearly) simultaneous failure of k components (i.e., N - k ). However, this improved reliability criterion significantly increases the number of contingency scenarios that must be considered when solving the unit commitment problem. Additional computational complexity is introduced when taking into account transmission switching. This relatively inexpensive method of redirecting power flows in the grid has been proposed as a way of introducing flexibility to better survive failure events. We present an algorithm for solving the unit commitment problem that simultaneously addresses both the challenges of the N - k security requirement and the use of transmission switching during operation. We analyze the algorithmic performance and present computational results for the IEEE24 and RTS-96 test systems for k = 1 and 2. We also include a discussion of how this approach might be extended to solve problems with k ≥ 3.

Keywords: unit commitment; transmission switching; robust power system operation; N - k security (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1287/ijoc.2017.0751 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:29:y:2017:i:4:p:645-659

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().