.png){kind=icon}
Return
Two-Stage Minimax Regret Robust Unit Commitment
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2013.2250530.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In addition to long-existing load uncertainty on power systems, continuously increasing renewable energy injections (such as wind and solar) have further made the power grid more volatile and uncertain. Stochastic and recently introduced robust optimization approaches have been studied to provide the day-ahead unit commitment decision with the consideration of real-time load and supply uncertainties. In this paper, we introduce an innovative minimax regret unit commitment model aiming to minimize the maximum regret of the day-ahead decision from the actual realization of the uncertain real-time wind power generation. Our approach will ensure the robustness of the unit commitment decision considering the inherent uncertainty in wind generation. Meanwhile, our approach will provide a system operator a clear picture in terms of the maximum regret value among all possible scenarios. A Benders' decomposition algorithm is developed to solve the problem. Finally, our extensive case studies compare the performances of three different approaches (robust optimization, minimax regret, and stochastic optimization) and verify the effectiveness of our proposed algorithm.
Keywords:
Benders' decomposition
minimax regret
uncertainty
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
View more organizations
Cited Papers
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
PREAI
ShareSave
Understanding the Effect of Side Reactions on the Recyclability of Furan–Maleimide Resins Based on Thermoreversible Diels–Alder Network.png)
Polymers
OAAI
PolymersIF0
OAAIShareSaveShareSaveShareSaveShareSaveShareSave View more