摘要
针对电力系统主动解列最优断面搜索过程中计算复杂度高与在线决策需要快速求解相矛盾的问题，该文提出基于凸优化的主动解列最优断面搜索方法。该方法以解列后系统有功不平衡功率最小为目标函数，将求解过程拆解为两阶段进行：第一阶段通过离线运算将系统解列的目标函数及约束转化为一系列满足凸优化条件的方程组；第二阶段在线将发电机及负荷的信息作为参数代入方程，采用内点法结合分支定界进行快速求解。并通过IEEE39节点算例验证方法的正确性、快速性与有效性。
Focusing on the contradiction between the computational complexity and the on-line time limit in the power system controlled islanding strategy. This paper proposed a minimized imbalanced power controlled islanding optimal search method based on the convex optimization. The proposed strategy process into two stages： Firstly, the objective functions and constraints were transformed into a series of convex equality and inequality equations off-line. Secondly, the generator and the load state were employed into the equations, and solved with the interior point method and the branch and bound algorithm. Simulation on the IEEE 39 bus system verified the proposed strategy is correct, fast and effective.
出处
《中国电机工程学报》
EI
CSCD
北大核心
2018年第1期168-177,共10页
Proceedings of the CSEE
基金
国家自然科学基金项目(51507116)
国家电网公司科技项目(SGTYHT/15-JS-191)~~
关键词
主动解列
最优断面搜索
最小不平衡功率
凸优化
controlled islanding
optimal partitionsections
minimal imbalance power
convex optimization
