.png){kind=icon}
返回
Contingency-Constrained Unit Commitment With n - K Security Criterion: A Robust Optimization Approach
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2010.2087367.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new approach for the contingency-constrained single-bus unit commitment problem. The proposed model explicitly incorporates an n - K security criterion by which power balance is guaranteed under any contingency state comprising the simultaneous loss of up to K generation units. Instead of considering all possible contingency states, which would render the problem intractable, a novel method based on robust optimization is proposed. Using the notion of umbrella contingency, the robust counterpart of the original problem is formulated. The resulting model is a particular instance of bilevel programming which is solved by its transformation to an equivalent single-level mixed-integer programming problem. Unlike previously reported contingency-dependent approaches, the robust model does not depend on the size of the set of credible contingencies, thus providing a computationally efficient framework. Simulation results back up these conclusions.
Keyword:
Bilevel programming
contingency-constrained unit commitment
n - K security criterion
robust optimization
umbrella contingency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Iron–nitrogen co-doped hierarchically mesoporous carbon spheres as highly efficient electrocatalysts for the oxygen reduction reaction.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏分享收藏Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability具有N-1可靠性的发电单元组合和传输切换的共同优化
OAAI
OAAI分享收藏
查看更多内容