电力系统动态无功优化问题的快速解耦算法  

Fast Decomposition Algorithm for Solution of Dynamic Reactive Power Optimization Problem in Power Systems

作　　者：赖永生[1] 刘明波[1] 

机构地区：[1]华南理工大学电力学院,广东省广州市510640

出　　处：《中国电机工程学报》2008年第7期32-39,共8页Proceedings of the CSEE

基　　金：国家自然科学基金项目(50277013);广东省自然科学基金项目(011648)~~

摘　　要：由于在全天24个时段的动态无功优化模型中加入了变压器分接头和电容器投切开关的全天允许动作次数限制,当采用引入离散惩罚的非线性原对偶内点法求解时,其修正方程的维数会随系统规模的增大而急剧增大。该文指出其修正方程系数矩阵可具有箭形分块结构,可采用两种方法将其精确解耦为25个低维线性方程组。应用稀疏矩阵的三角分解技术可实现对它们的快速求解。一个实际的14节点系统和IEEE 118节点系统的计算结果表明,应用提出的快速解耦算法能在保证电容器和变压器分接头满足全天最大允许动作次数约束和运行约束的前提下,获得近似最优离散解,且具有较快的计算速度。The ＇reduced linear correction equation＇s dimension increases rapidly with enlargement of system size when the dynamic reactive power optimization problem in the next 24 hours is solved by nonlinear primal-dual interior-point algorithm introducing discretization penalty, in which the limits for switching operations of capacitors and transformer load tap changers are considered. That the coefficient matrix of the reduced linear correction equation has arrow-shaped block structure and can be accurately decomposed into 25 sets of low-dimension linear equations by two algorithms was proposed. They could be solved speedily by means of the sparse technique based triangular factorization. The numerical results on a real 14-bus and IEEE ll8-bus systems show that the proposed algorithm can provide approximate optimal discrete solutions at a fast speed while satisfying maximum allowable daily switching operation limits of capacitors and transformer load tap changers.

关 键 词：动态无功优化 非线性原对偶内点法 离散惩罚 精确解耦 三角分解 

分 类 号：TM71[电气工程—电力系统及自动化]