.png){kind=icon}
.png){kind=icon}
Return
A Distributionally Robust AC Network-Constrained Unit Commitment
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2021.3078801.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a distributionally robust network-constrained unit commitment (DR-NCUC) model considering AC network modeling and uncertainties of demands and renewable productions. The proposed model characterizes uncertain parameters using a data-driven ambiguity set constructed by training samples. The non-convex AC power flow equations are approximated by convex quadratic and McCormick relaxations. Since the proposed min-max-min DR-NCUC problem cannot be solved directly by available solvers, a new decomposition algorithm with proof of convergence is reported in this paper. The master problem of this algorithm is solved using both primal and dual cuts, while the max-min sub-problem is solved using the primal-dual hybrid gradient method, obviating the need for using duality theory. Also, an active set strategy is proposed to enhance the tractability of the decomposition algorithm by ignoring the subset of inactive constraints. The proposed model is applied to a 6-bus test system and the IEEE 118-bus test system under different conditions. These case studies illustrate the performance of the proposed DR-NCUC model to characterize uncertainties and the superiority of the proposed decomposition algorithm over other decomposition approaches using either primal or dual cuts.
Keywords:
Mathematical model
Load flow
Training
Power transmission lines
Uncertainty
Production
Transmission line measurements
Convexification
decomposition
distributionally robust optimization
unit commitment
uncertainty
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