.png){kind=icon}
返回
Contingency-constrained unit commitment with post-contingency corrective recourse
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-014-1760-x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an -- reliability criterion. This reliability criterion is a generalization of the well-known - criterion and dictates that at least fraction of the total system demand (for ) must be met following the failure of 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. These studies demonstrate the effectiveness of our proposed methods relative to current state-of-the-art.
Keyword:
Integer programming
Bi-level programming
Benders decomposition
Unit commitment
Contingency constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
Iron–nitrogen co-doped hierarchically mesoporous carbon spheres as highly efficient electrocatalysts for the oxygen reduction reaction.png)
RSC AdvancesOAAI
RSC AdvancesIF0
OAAI分享收藏分享收藏Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability具有N-1可靠性的发电单元组合和传输切换的共同优化
OAAI
OAAI分享收藏
查看更多内容