Skip to main navigation Skip to search Skip to main content

A convex approximation for optimal DER scheduling on unbalanced power distribution networks

Research output: Contribution to journalArticleScientificpeer-review

138 Downloads (Pure)

Abstract

The increase of solar photovoltaic penetration poses several challenges for distribution network operation, mainly because such high penetration might cause reliability problems like protection malfunctioning, accelerated decay of voltage regulators and voltage violations. Existing solutions based on mathematical programming solve a 3-phase ACOPF to optimally exploit the available energy, however, this might increase all reliability problems above if done carelessly. As a solution to optimally exploit DERs (like local photovoltaic and storage systems) without compromising the network reliability, this paper presents a novel algorithm to solve the 3-phase ACOPF as a sequence of convex Quadratically Constrained Quadratic Programs. Results show that this solution has a lower voltage unbalance and computation time than its non-linear counterpart, furthermore, it converges to a primal feasible point for the non-linear formulation without major sacrifices on optimal DER active power injections.

Original languageEnglish
Pages (from-to)281-291
Number of pages11
JournalDYNA (Colombia)
Volume86
Issue number208
DOIs
Publication statusPublished - 1 Jan 2019

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 7 - Affordable and Clean Energy
    SDG 7 Affordable and Clean Energy

Keywords

  • DER scheduling
  • Optimal power flow
  • Power distribution networks
  • Quadratic constrained quadratic programming
  • Renewable energy
  • Storage systems

Fingerprint

Dive into the research topics of 'A convex approximation for optimal DER scheduling on unbalanced power distribution networks'. Together they form a unique fingerprint.

Cite this