.png){kind=icon}
Return
Distributionally Robust Contingency-Constrained Unit Commitment
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2017.2699121.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Distributional robustness
N - k security criterion
unit commitment
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
View more