求解计及失负荷概率约束机组组合问题的快速启发式算法

One Fast Heuristic Approach for Unit Commitment Considering Loss-of-load Probability Constraints

为了解决电力系统机组组合中的备用配置问题,提出了一种求解计及失负荷概率约束机组组合问题的快速启发式算法。该算法通过对计及备用约束机组组合问题与运行可靠性评估问题的迭代求解,将机组组合计划对应的失负荷概率指标控制在给定水平;通过对迭代中备用更新步长的直接估计,提高了备用更新效率,达到了减少迭代次数、提高整体计算速度的目的。相较于已有算法,该算法提高了计算的快速性及计算结果的鲁棒性。通过对单区域及多区域RTS-96系统的测试计算,验证了算法的有效性。

To solve reserve dispatch problem in unit commitment,a fast heuristic approach for unit commitment considering loss-of-load probability constraints is proposed in this paper.The loss-of-load probability con-straints are fulfilled by the iteration between the traditional spinning reserve constrained unit commitment and operating reliability estimation.The necessary spinning reserve is estimated directly to reduce the times of iter-ation,and then accelerate the calculation.The features of the approach are the fastness of the algorithm and the robustness of the results.Case studies on one area and multi-area RTS-96 systems illustrate the efficiency of the proposed approach.