4.4 Article

ACOPF for three-phase four-conductor distribution systems: semidefinite programming based relaxation with variable reduction and feasible solution recovery

Journal

IET GENERATION TRANSMISSION & DISTRIBUTION
Volume 13, Issue 2, Pages 266-276

Publisher

INST ENGINEERING TECHNOLOGY-IET
DOI: 10.1049/iet-gtd.2018.5033

Keywords

optimisation; mathematical programming; convex programming; distributed power generation; load flow; neutral conductors; ground resistances; zero-injection phases; convex semidefinite programming relaxation model; possible solution inexactness; SDP relaxation model; Karush-Kuhn-Tucker condition based process; feasible solutions; original ACOPF problem; modified IEEE 123-bus system; variable reduction; feasible solution recovery process; four-conductor configured distribution systems; three-phase four-conductor distribution systems; semidefinite programming based relaxation; distributed energy resources; power flow congestion; unsymmetrical network configurations; solution approaches

Funding

  1. U.S. National Science Foundation [PFI: BIC-1534035, CNS-1647135]

Ask authors/readers for more resources

Emerging distribution systems with a proliferation of distributed energy resources are facing with new challenges, such as voltage collapse and power flow congestion in unsymmetrical network configurations. As a fundamental tool that could help quantify these new challenges and further mitigate their impacts on the secure and economic operation of distribution systems, effective AC optimal power flow (ACOPF) models and solution approaches are in urgent need. This study focuses on ACOPF of three-phase four-conductor configured distribution systems, in which neutral conductors and ground resistances are modelled explicitly to reflect practical situation. In addition, by leveraging the Kirchhoff's current law (KCL) theorem and the effect of zero injections, voltage variables of neutrals and zero-injection phases can be effectively eliminated. The ACOPF problem is formulated as a convex semidefinite programming (SDP) relaxation model in complex domain. In recognising possible solution inexactness of SDP relaxation model, a Karush-Kuhn-Tucker condition based process is further proposed to effectively recover feasible solutions to the original ACOPF problem by calculating a set of computational-inexpensive non-linear equations. Numerical studies on a modified IEEE 123-bus system show the effectiveness of the proposed SDP relaxation model with variable reductions and the feasible solution recovery process for three-phase four-conductor configured distribution systems.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available