.png){kind=icon}
Return
Adaptive Robust Optimization for the Security Constrained Unit Commitment Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2012.2205021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Unit commitment, one of the most critical tasks in electric power system operations, faces new challenges as the supply and demand uncertainty increases dramatically due to the integration of variable generation resources such as wind power and price responsive demand. To meet these challenges, we propose a two-stage adaptive robust unit commitment model for the security constrained unit commitment problem in the presence of nodal net injection uncertainty. Compared to the conventional stochastic programming approach, the proposed model is more practical in that it only requires a deterministic uncertainty set, rather than a hard-to-obtain probability distribution on the uncertain data. The unit commitment solutions of the proposed model are robust against all possible realizations of the modeled uncertainty. We develop a practical solution methodology based on a combination of Benders decomposition type algorithm and the outer approximation technique. We present an extensive numerical study on the real-world large scale power system operated by the ISO New England. Computational results demonstrate the economic and operational advantages of our model over the traditional reserve adjustment approach.
Keywords:
Bilevel mixed-integer optimization
power system control and reliability
robust and adaptive optimization
security constrained unit commitment
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers
ShareSaveUnderstanding the Effect of Side Reactions on the Recyclability of Furan–Maleimide Resins Based on Thermoreversible Diels–Alder Network.png)
Polymers
OAAI
PolymersIF0
OAAIShareSaveShareSaveShareSave
View more