大电网动态无功优化的快速解耦算法

建立电网的完整动态无功优化模型是一个计及设备动作次数约束并考虑变量离散化特性的非线性混合整数规划问题。由于其修正方程系数矩阵具有可分块结构特点,对此系数矩阵采用块矩阵解耦求解,能够在一定程度上解决大电网计算时的＂维数灾＂问题。上述计算的关键点是对修正方程系数矩阵的计算存储及对系数矩阵进行三角分解结果的计算存储,对此提出对系数矩阵进行两次三角分解的方法,大大地降低大电网计算的数据存储量。以一个实际的14节点供电系统、某省级538节点系统和IEEE 118节点系统作为算例,计算结果表明,所提出的算法能有效地解决大电网的动态无功优化＂维数灾＂问题。

Fast Decomposition Algorithm for the Dynamic Reactive Power Optimization of Large-Scale Power Grid

To build up an integrated dynamic reactive-power optimization model for a power system is a mixed-integer/nonlinear programming problem of a system while its devices action number constraints and variable discretization being considered. As the coefficient matrix of reduced linear correction equation of the model has arrow-shaped block structure, the method of block-matrix decoupling can somehow overcome the difficulty of so-called "dimensionality curse" when a large-scale power system is calculated. The key points of above mentioned calculation are to make computation and storage of coefficient matrix and the triangular factorization results of the coefficient matrix, and it is proposed in this paper that the scale of storage data can be greatly reduced through twice triangular decomposition of the coefficient matrix. A real 14-bus power supply system, a 538-bus provincial system and the IEEE 118-bus system are calculated, and the results show that the proposed algorithm can overcome the difficulty of dimensionality curse in the dynamic reactive power optimization of large-scale power grid.