Abstract
The three-phase distribution optimal power flow (D-OPF) problem has attracted much attention in recent years due to practical requirements for managing distributed energy resources and multi-energy customers in unbalanced active distribution systems. To deal with the strong nonconvexity of the three-phase OPF problem, this paper develops the semidefinite programming (SDP) formulation of three-phase OPF problems considering the mutual coupling in multi-phase networks. Instead of directly dropping the rank-one constraints, a sequential convex optimization algorithm based on the convex-concave procedure (CCP) is proposed for recovering a feasible and optimal solution of three-phase power flow. The proposed iterative algorithm not only has high computational efficiency but also guarantees the optimality when the semidefinite relaxation or second-order cone relaxation method is inexact. Case studies on various IEEE testing distribution systems verify that the proposed algorithm recovers the feasible and optimal power flow solution. It also exhibits a relatively low number of iterations and short solving time in large-scale IEEE testing systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
