电网规划中区间最小切负荷量的计算方法

Algorithm to Solve Interval Minimum Load Cutting Problem for Transmission Planning

研究电网规划中负荷不确定性表示为区间数时,计及发电机出力调整下的最小切负荷量计算问题。提出一种精确求解区间负荷下系统最小切负荷量区间数表示的区间最小切负荷计算方法。给出区间至多切负荷的定义并建立基于双层线性规划的区间至多切负荷模型,使用分支定界算法求解此模型可得区间最小切负荷的区间上限;给出区间至少切负荷的定义并建立区间至少切负荷模型,求解此模型可得区间最小切负荷的区间下限。该方法可有效避免使用蒙特卡罗模拟法求解此类问题时计算量大,结果一般不精确的缺点,为区间不确定信息下的系统安全性研究提供一条新的思路。算例的结果验证该方法的正确性和有效性。

The minimum load cutting problem for transmission system planning when the load uncertainty is considered as an interval number and generator readjustment included is studied. An interval minimum load cutting algorithm is proposed to solve this problem and can get the precise solution in the form of interval number. The interval most load cutting definition is given. Its model based on the bi-level linear programming is established and has been proved to be able to satisfy the sufficient condition of the existence of optimal solution. The branch and bound algorithm is used to solve this model and get the upper limit of the interval minimum load cutting. The interval least load cutting definition is given. Its model is established and can be solved to get the lower limit of the interval minimum load cutting. The approach proposed in this paper is superior to the Monte Carlo method both in the facet of time-consuming and precision, and finds a new way to the study of system security under interval uncertainty. The case study results show the rightness and validity of the approach.