返回
Distributionally Robust Contingency-Constrained Unit Commitment
DOI:10.1109/TPWRS.2017.2699121.png)
摘要
En 中文
This paper proposes a distributionally robust optimization approach for the contingency-constrained unit commitment problem. In our approach, we consider a case where the true probability distribution of contingencies is ambiguous, i.e., difficult to accurately estimate. Instead of assigning a (fixed) probability estimate for each contingency scenario, we consider a set of contingency probability distributions (termed the ambiguity set) based on the N - k security criterion and moment information. Our approach considers all possible distributions in the ambiguity set, and is hence distributionally robust. Meanwhile, as this approach utilizes moment information, it can benefit from available data and become less conservative than the robust optimization approaches. We derive an equivalent reformulation and study a Benders' decomposition algorithm for solving the model. Furthermore, we extend the model to incorporate wind power uncertainty. The case studies on a 6-Bus system and the IEEE 118-Bus system demonstrate that the proposed approach provides less conservative unit commitment decisions as compared with the robust optimization approach.
Keyword:
Distributional robustness
N - k security criterion
unit commitment
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Distributionally Robust Solution to the Reserve Scheduling Problem With Partial Information of Wind Power含风电部分信息的备用调度问题的分布式鲁棒解
Matrix Extension Validation of AOCS Ce 2c‐11 for Omega‐3 Polyunsaturated Fatty Acids in Conventional Foods and Dietary Supplements Containing Added Marine OilAOCS Ce 2c‐11 法对含添加海产油的常规食品和膳食补充剂中 ω‐3 多不饱和脂肪酸的矩阵扩展验证

