计及N-k网络安全约束的二阶段鲁棒机组组合

为提高调度决策的安全性以增强其应对偶发线路故障扰动的能力,文中提出一种计及N-k网络安全约束的二阶段鲁棒机组组合模型。首先,介绍了2种当前研究中采用的N-k不确定集合,并对集合特点进行了阐述;其次,基于2种N-k不确定集合,构建了一般形式的二阶段鲁棒机组组合模型。其中,第一阶段为线路故障前的机组启停决策;第二阶段为观测到线路故障最坏情况下的经济调度决策。所提模型可采用列与约束生成(CCG)算法将第一阶段、第二阶段问题分别对应转化为主问题与子问题进行迭代求解,并且运用对偶原理和线性化技术,可将主问题与子问题均转化为混合整数线性规划(MILP)模型。最后,通过对IEEE 14节点及IEEE 118节点系统的测试分析,验证了所提模型的有效性。

Two-stage robust unit commitment considering N-k network security constraints

In order to improve the security of scheduling decision and enhance its ability to deal with occasional line contingencies, a two-stage robust unit commitment model considering N-k network security constraints is proposed . Firstly, two kinds of N-k uncertainty sets used in the current research are introduced, and the characteristics of the set are described. Secondly, based on the two kinds of N-k uncertainty sets, a general form of two-stage robust unit commitment model is constructed. The formulation is divided into two stages, where the first stage is the unit commitment decision before the line contingency, and the second stage is the economic dispatching decision as the worst case of line contingencies are observed. The first and second stage problems are reformulated into a master problem and sub-problem, respectively, So that the column-and-constraint generation (C& CG) algorithm can be used to solve the proposed two-stage unit commitment model in an iterative manner. By using linearization techniques and duality theory, both the master problem and the sub-problem can be converted into mixed integer linear programming (MILP). Finally, the validity of the proposed model was verified by the calculation and analysis of the IEEE 14 bus and IEEE 118 bus systems.