The increasing penetration level of wind power challenges robust unit commitment with feasibilities and high computational burden. To meet these challenges, we propose two-fold advances for the two-stage robust unit commitment (TS-RUC), aiming at providing feasible solution and efficient decision tool for the TS-RUC with multiple wind farms. First, the feasibility identification method is proposed to ensure the tractability of the TS-RUC. The feasibility boundaries are determined based on values of two sets of introduced slack variables, the wind power curtailment and load shedding. Second, the disjunctive programming is used to improve the computational efficiency of the max-min problem, which is reformulated with convex hull relaxation (CHR) method to reduce constraints embedding binary uncertainty variables. Simulation results on the modified IEEE-118 bus system and Henan power grid demonstrate that the proposed improvement for the TS-RUC can be implemented for power systems with multiple wind farms and significant wind power. The feasibility identification can guarantee a feasible solution and the use of the CHR can improve computational efficiency.

中文翻译：

---

多风电场两阶段RUC的可行性识别和计算效率的提高

不断增长的风电渗透水平挑战着具有可行性和高计算量的强大机组承诺。为了应对这些挑战，我们为两阶段鲁棒机组承诺（TS-RUC）提出了两项​​改进，旨在为具有多个风电场的TS-RUC提供可行的解决方案和有效的决策工具。首先，提出了可行性识别方法，以确保TS-RUC的可处理性。可行性边界是根据两组引入的松弛变量的值确定的，即风能削减和减载。其次，通过使用析取编程来提高最大-最小问题的计算效率，并使用凸壳松弛（CHR）方法对其进行了重构，以减少嵌入二进制不确定性变量的约束。在改进的IEEE-118总线系统和河南电网上进行的仿真结果表明，针对TS-RUC的改进建议可以在具有多个风电场和大量风力的电力系统中实施。可行性识别可以保证可行的解决方案，CHR的使用可以提高计算效率。