Chordal Conversion Based Convex Iteration Algorithm for Three-Phase Optimal Power Flow Problems
Chordal Conversion Based Convex Iteration Algorithm for Three-Phase Optimal Power Flow Problems
复制标题
DOI：
10.1109/tpwrs.2017.2735942
复制
发表时间：
2018-03
影响因子：
6.6
通讯作者：
Wei Wang;N. Yu
中科院分区：
文献类型：
--
作者：
Wei Wang;N. Yu
由于需要协调不平衡电力分配系统中大规模且异构的分布式能源的运行，三相最优潮流（OPF）问题最近吸引了很多研究兴趣。三相OPF问题的非凸性比单相OPF问题的非凸性强得多。本文提出采用凸迭代算法来解决非凸三相OPF问题，而不是应用半定规划松弛技术。为了使凸迭代算法对于大规模配电网络具有计算效率，基于弦变换的技术被嵌入到凸迭代框架中。通过协同结合凸迭代方法和基于弦的转换技术，所提出的三相OPF算法不仅计算效率高，而且当正则化项的迹变为零时保证全局最优性。最后，为了进一步提高计算性能，提出了一种贪婪网格划分算法，将表示配电网络的单个大矩阵分解为许多较小的矩阵。使用标准 IEEE 测试馈线的仿真结果表明，所提出的算法计算效率高、可扩展，并在解决排名难题的同时产生全局最优解。
The three-phase optimal power flow (OPF) problem has recently attracted a lot of research interests due to the need to coordinate the operations of large-scale and heterogeneous distributed energy resources in unbalanced electric power distribution systems. The nonconvexity of the three-phase OPF problem is much stronger than that of the single-phase OPF problem. Instead of applying the semidefinite programming relaxation technique, this paper advocates a convex iteration algorithm to solve the nonconvex three-phase OPF problem. To make the convex iteration algorithm computationally efficient for large-scale distribution networks, the chordal conversion based technique is embedded in the convex iteration framework. By synergistically combining the convex iteration method and the chordal based conversion technique, the proposed three-phase OPF algorithm is not only computationally efficient but also guarantees global optimality when the trace of the regularization term becomes zero. At last, to further improve the computational performance, a greedy grid partitioning algorithm is proposed to decompose a single large matrix representing a distribution network to many smaller matrices. The simulation results using standard IEEE test feeders show that the proposed algorithm is computationally efficient, scalable, and yields global optimal solutions while resolving the rank conundrum.