.png){kind=icon}
返回
Chordal Conversion Based Convex Iteration Algorithm for Three-Phase Optimal Power Flow Problems
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2017.2735942.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Chordal conversion
convex iteration
distribution system operator
three-phase optimal power flow
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
An efficient interior point method for sequential quadratic programming based optimal power flow基于序列二次规划的最优潮流的有效内点方法
PREAI
分享收藏
查看更多内容