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

DOI10.1287/ijoc.2017.0751zbMath1446.90068OpenAlexW2743142022WikidataQ114967839 ScholiaQ114967839MaRDI QIDQ5131693

Richard Li-Yang Chen, Kathryn M. Schumacher, Amy Mainville Cohn

Publication date: 9 November 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2017.0751

zbMATH Keywords

unit commitmenttransmission switching\(N\)-\(k\) securityrobust power system operation

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (3)

A data mining transmission switching heuristic for post-contingency AC power flow violation reduction in real-world, large-scale systems ⋮ Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services ⋮ Fast computation of global solutions to the single-period unit commitment problem

Cites Work

• Contingency-constrained unit commitment with post-contingency corrective recourse
• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Adjustable robust solutions of uncertain linear programs
• Fenchel decomposition for stochastic mixed-integer programming
• On parallelizing dual decomposition in stochastic integer programming
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
• A bilevel mixed-integer program for critical infrastructure protection planning
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs
• Co-Optimization of Energy and Ancillary Service Markets
• Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
• The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

This page was built for publication: Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching