.png){kind=icon}
.png){kind=icon}
Return
Joint Chance-Constrained Unit Commitment: Statistically Feasible Robust Optimization With Learning-to-Optimize Acceleration
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2024.3351435.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Renewable energy penetration increases the power grid's operational uncertainty, threatening the economic effectiveness and reliability of the grid. In this article, we examine how uncertainty affects unit commitment (UC), a classical electricity market procedure. Stochastic programming has helped handle uncertainty for UC and performed well with distribution knowledge, but the lack of such information in practice deteriorates the effectiveness. Such a dilemma becomes more pronounced when dealing with joint chance constraints solely based on samples. To address this issue, we introduce statistical feasibility into UC and develop robust sample-based algorithms employing appropriate uncertainty sets to hedge uncertainty without distribution dependence. We also propose a learn-to-optimize acceleration method to convexify UC. Furthermore, we construct an optimization kernel to boost computational efficiency.
Keywords:
Uncertainty
Optimization
Renewable energy sources
Generators
Stochastic processes
Kernel
Computational efficiency
Chance-constrained programming
robust optimization
statistical feasibility
unit commitment
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W