.png){kind=icon}
返回
Modeling Transmission Line Constraints in Two-Stage Robust Unit Commitment Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2013.2291498.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Integration of renewable energy sources and demand response poses new challenges to system operators as they increase the uncertainty of the power supply and demand. Recently, robust optimization techniques are applied to the unit commitment problem with uncertainty as an alternative to the stochastic programming approaches. However, it remains challenging to solve the robust unit commitment model with full transmission line constraints. In this paper, we propose novel acceleration techniques for solving two-stage robust unit commitment problem with consideration of full transmission line constraints. We use 1) the cutting-plane algorithm for the master problem, which dynamically includes critical transmission line constraints, and 2) column-generation methods, including the branch-and-price-and-cut algorithm and heuristic approaches, for the subproblems, which add only necessary transmission line dual variables on the fly. Computational results for the modified IEEE 118-bus system show that the combination of the cutting-plane algorithm and the heuristic column-generation approach greatly reduces the total solution time of the two-stage robust unit commitment problem.
Keyword:
Load-shift-factor
two-stage robust optimization
unit commitment
wind power
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Adaptive Robust Optimization for the Security Constrained Unit Commitment Problem安全约束机组组合问题的自适应鲁棒优化OAAI
.png){kind=icon}
OAAI分享收藏分享收藏Contingency-Constrained Unit Commitment With n - K Security Criterion: A Robust Optimization Approach具有n-k安全准则的偶然性约束单元承诺: 一种鲁棒的优化方法
PREAI
分享收藏
查看更多内容