摘要
In this letter, we propose a tractable formulation and an efficient solution method for the Wasserstein-metric-based distributionally robust unit commitment (DRUC-dW) problem. First, a distance-based data aggregation method is introduced to hedge against the dimensionality issue arising from a huge volume of data. Then, we propose a novel cutting plane algorithm to solve the DRUC-dW problem much more efficiently than state-of-the-art. The novel solution method is termed extremal distribution generation, which is an extension of the column-and-constraint generation method to the distributionally robust cases. The feasibility and cost efficiency of the model, and the efficiency of the solution method are numerically validated.
学科与关键词
关键词
RobustnessMeasurementOptimizationData aggregationLinear programmingNumerical modelsIndexesDimensionality reductiondistributionally robust optimizationextremal distributionWasserstein metric
- Day-ahead Network-constrained Unit Commitment Considering Distributional Robustness and Intraday Discreteness: A Sparse Solution ApproachZheng, Xiaodong*; Zhou, Baorong; Wang, Xiuli; Zeng, Bo; Zhu, Jizhong; Chen, Haoyong; Zheng, WaishengJournal of Modern Power Systems and Clean Energy, 2023, 11(2): 489-501.被引 1
- Addressing the Conditional and Correlated Wind Power Forecast Errors in Unit Commitment by Distributionally Robust OptimizationZheng, Xiaodong; Qu, Kaiping*; Lv, Jiaqing; Li, Zhengmao; Zeng, BoIEEE Transactions on Sustainable Energy, 2021, 12(2): 944-954.被引 27
- A Mixed-integer SDP Solution to Distributionally Robust Unit Commitment with Second Order Moment ConstraintsZheng, Xiaodong; Chen, Haoyong*; Xu, Yan; Li, Zhengmao; Lin, Zhenjia; Liang, ZipengCSEE Journal of Power and Energy systems, 2020, 6(2): 374-383.被引 20
