TY - GEN
T1 - A Distributed Optimal Power Flow Algorithm that Incorporates A Priori Congestion Information through Bounded Dual Updates
AU - Zhang, Shaobo
AU - Hedman, Kory W.
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/4/11
Y1 - 2021/4/11
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85113398560&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85113398560&partnerID=8YFLogxK
U2 - 10.1109/NAPS50074.2021.9449694
DO - 10.1109/NAPS50074.2021.9449694
M3 - Conference contribution
AN - SCOPUS:85113398560
T3 - 2020 52nd North American Power Symposium, NAPS 2020
BT - 2020 52nd North American Power Symposium, NAPS 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 52nd North American Power Symposium, NAPS 2020
Y2 - 11 April 2021 through 13 April 2021
ER -