基于改进内点半定规划算法的拟直流最优潮流

Quasi Direct Current Optimal Power Flow Based on Modified Semi-Definite Programming Algorithm

拟直流最优潮流(quasi direct current optimal power flow,QDCOPF)模型将复杂的非线性规划问题线性化处理,使得问题模型结构简单,求解速度快,但是计算精度偏低。基于此,提出一种基于改进内点半定规划(modified semidefinite programming,MSDP)算法的QDCOPF。一方面,该算法采用半定规划(SDP)算法求解QDCOPF模型,充分利用了SDP鲁棒性强,对初值不敏感和可以收敛到全局最优解的优良性质;另一方面,对映射到SDP模型中的变量进行优化重组,将具有代数关系的变量组成一个变量组,形成一个程序运行子块,加强模型块内部变量联系的同时,减小模型块间变量的耦合。对IEEE 30、118、300节点系统的仿真测试结果表明,基于MSDP的QDCOPF算法比传统QDCOPF的求解算法具有更高的计算精度和计算效率,从而验证了所提算法的可行性和高效性。

The quasi direct current optimal power flow（QDCOPF） model can linearize the complex nonlinear programming problem, its mathematical model structure is simple. With this model the OPF problem is solved faster but with low accuracy. Based on this situation, this paper proposed a QDCOPF based on modified semi-definite programming（MSDP） algorithm. On one hand, this algorithm adopts the SDP to solve QDCOPF model, utilizing the strong robustness nature of SDP, insensitive to initial value and able to converge to the global optimal solution. On the other hand, this algorithm optimizes the variables of SDP model, it makes up the mathematically related variables into a group and then forms a sub-block. This improved method strengthens the contact of the internal variables in a sub-block, while reducing the coupling between the variables in different sub-blocks. Finally, it follows from the simulation results of IEEE 30-bus, 118-bus and 300-bus test systems that the proposed method has higher accuracy and computational efficiency than traditional algorithm. This algorithm is proved successful and efficient.