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

DOI10.1287/IJOC.2017.0751MaRDI QIDQ5131693zbMATH OpenOpenAlexWikidataFDO

Authors Kathryn M. Schumacher, Richard Li-Yang Chen, Amy 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

\(N\)-\(k\) securityrobust power system operationtransmission switchingunit commitment

Mathematics Subject Classification ID

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

Recommendations

• Robust unit commitment with n-1 security criteria
• A deterministic method for the unit commitment problem in power systems
• Two-stage network constrained robust unit commitment problem
• A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
• Unit commitment under uncertainty in AC transmission systems via risk averse semidefinite stochastic programs
• A polynomial-time algorithm with tight error bounds for single-period unit commitment problem
• On the complexity of the unit commitment problem
• A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems
• Tight MIP formulations of the power-based unit commitment problem

Cites work

• A bilevel mixed-integer program for critical infrastructure protection planning
• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Adjustable robust solutions of uncertain linear programs
• Co-optimization of energy and ancillary service markets
• Contingency-constrained unit commitment with post-contingency corrective recourse
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
• 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
• Fenchel decomposition for stochastic mixed-integer programming
• On parallelizing dual decomposition in stochastic integer programming
• Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• The N-k problem in power grids: new models, formulations, and numerical experiments
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse

Cited in

(9)

• Fast computation of global solutions to the single-period unit commitment problem
• \(N-1-1\) contingency-constrained unit commitment with renewable integration and corrective actions
• DECOUPLED SECURE ECONOMIC DISPATCH ALGORITHM FOR POWER SYSTEMS OPERATION
• The N-k problem in power grids: new models, formulations, and numerical experiments
• Security-constrained optimization framework for large-scale power systems including post-contingency remedial actions and inter-temporal constraints
• Multistage stochastic power generation scheduling co-optimizing energy and ancillary services
• Contingency-constrained unit commitment with post-contingency corrective recourse
• Robust unit commitment with n-1 security criteria
• A data mining transmission switching heuristic for post-contingency AC power flow violation reduction in real-world, large-scale systems

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

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