A Distributed Optimal Power Flow Algorithm that Incorporates A Priori Congestion Information through Bounded Dual Updates

Shaobo Zhang, Kory W. Hedman

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Distributed optimal power flow (OPF) algorithms have been proposed as scalable optimization tools for the future grid; however, few of them incorporated a priori information about transmission congestion from operational experience, a prevalent technique to improve the computational performance when the OPF problem is solved in a centralized way. Centralized OPF algorithms typically include only a fraction of line flow limit constraints that are predicted to be binding. In this paper, a heuristic is proposed to incorporate a priori congestion information into the dual updates of a distributed OPF algorithm. The dual solution of the consensus constraints for phase angles is derived through duality theory, and it is shown to be correlated with the congestion status of nearby lines. Instead of updating the dual variables without restrictions, the proposed heuristic proposes to apply bounds determined from the congestion information in the dual update step. Numerical studies on a 3012-bus Polish system verified the effectiveness of the proposed method.

Original languageEnglish (US)
Title of host publication2020 52nd North American Power Symposium, NAPS 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728181929
StatePublished - Apr 11 2021
Event52nd North American Power Symposium, NAPS 2020 - Tempe, United States
Duration: Apr 11 2021Apr 13 2021

Publication series

Name2020 52nd North American Power Symposium, NAPS 2020


Conference52nd North American Power Symposium, NAPS 2020
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Safety, Risk, Reliability and Quality
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this