Contingency-constrained unit commitment with post-contingency corrective recourse

DOI10.1007/S10479-014-1760-XMaRDI QIDQ513648zbMATH OpenOpenAlexFDO

Authors Richard Li-Yang Chen, Neng Fan, Jean-Paul Watson, Ali Pinar

Publication date 7 March 2017

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.2964, http://hdl.handle.net/10150/623036

zbMATH Keywords

benders decompositionbi-level programmingcontingency constraintsinteger programmingunit commitment

Mathematics Subject Classification ID

Mixed integer programming (90C11) Applications of mathematical programming (90C90)

Abstract: 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-e reliability criterion. This reliability criterion is a generalization of the well-known $N$-$k$ criterion, and dictates that at least $(1-e_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.

Recommendations

• Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
• Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
• Two-stage network constrained robust unit commitment problem
• Cutting planes for the multistage stochastic unit commitment problem
• Large-scale unit commitment under uncertainty

Cites work

• A decomposition approach to the two-stage stochastic unit commitment problem
• Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
• Partitioning procedures for solving mixed-variables programming problems
• The N-k problem in power grids: new models, formulations, and numerical experiments
• The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems

Cited in

(4)

• Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization
• \(N-1-1\) contingency-constrained unit commitment with renewable integration and corrective actions
• Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
• A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems

This page was built for publication: Contingency-constrained unit commitment with post-contingency corrective recourse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513648)