Abstract
The N-1-1 contingency reliability criterion considers the consecutive loss of two components in a power system, with intervening time for system adjustments between the two losses. In this paper, we consider the problem of optimizing generation unit while ensuring the N-1-1 criterion. Due to the coupling of time periods associated with consecutive component losses, the resulting problem yields a very large-scale mixed-integer linear optimization model. For efficient solution, we introduce a novel branch-and-cut algorithm using a temporally decomposed bilevel separation oracle. The model and algorithm are assessed using multiple IEEE test systems, and a comprehensive analysis is performed to compare system performance across different contingency criteria. Computational results demonstrate the value of considering intervening time for system adjustments in terms of total cost and system robustness.
| Original language | English (US) |
|---|---|
| Article number | 7582530 |
| Pages (from-to) | 3049-3059 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Power Systems |
| Volume | 32 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 2017 |
| Externally published | Yes |
Keywords
- Benders decomposition
- branch-and-cut algorithms
- contingency constraints
- non-simultaneous failures
- unit commitment
ASJC Scopus subject areas
- Energy Engineering and Power Technology
- Electrical and Electronic Engineering