.png){kind=icon}
Return
Adaptive Robust Network-Constrained AC Unit Commitment
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2016.2562141.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an adaptive robust network-constrained AC unit commitment (AC-UC) model. This model is formulated as a min-max-min optimization problem, which allows representing the uncertain nature of wind power productions in terms of bounded intervals. A tri-level decomposition algorithm using primal and dual cutting planes is introduced to solve this AC-UC problem and to find a robust commitment schedule withstanding the worst realizations of uncertain wind power. To reduce the computation burden and to obtain a tractable formulation, the AC power flow equations are convexified using a Signomial transformation. The proposed AC-UC model is illustrated using the IEEE 24-bus reliability test system. Simulation results demonstrate the efficiency of the proposed approach.
Keywords:
AC network modeling
convexification
decomposition algorithm
robust optimization (RO)
unit commitment (UC)
wind power production
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}
ShareSave
ShareSaveDecentralized Multiarea Robust Generation Unit and Tie-Line Scheduling Under Wind Power Uncertainty
PREAI
ShareSave
View more