TY - GEN
T1 - Optimal Power Flow Solution for Distribution Networks using Quadratically Constrained Programming and McCormick Relaxation Technique
AU - Javadi, Mohammad Sadegh
AU - Gouveia, Clara Sofia
AU - Carvalho, Leonel Magalhães
AU - Silva, Ricardo
N1 - Publisher Copyright:
© 2021 IEEE
PY - 2021
Y1 - 2021
N2 - This paper presents a quadratically constrained programming (QCP) model to tackle the optimal power flow (OPF) problem in distribution networks. The proposed model is fast, reliable, and precise enough to be embedded into the multi-temporal power system analysis. The proposed model benefits from a standard QCP to solve the branch active and reactive power flows. The second-order conic programming (SOCP) approach has been applied to address the quadratic constraints. The nonconvex feature of the OPF problem has been relaxed utilizing the McCormick envelopes. To find the minimum current of each branch, the lossless power flow model has been first solved and the obtained results have been considered for solving the OPF problem. The IEEE 33-bus test system has been selected as the benchmark to verify the efficient performance of the proposed OPF model. The simulation study confirms that the McCormick envelopes used in the QCP approach lead to precise results with a very fast convergence time. Overall, the presented model for the OPF can be extended for both planning and operation purposes in distribution system studies.
AB - This paper presents a quadratically constrained programming (QCP) model to tackle the optimal power flow (OPF) problem in distribution networks. The proposed model is fast, reliable, and precise enough to be embedded into the multi-temporal power system analysis. The proposed model benefits from a standard QCP to solve the branch active and reactive power flows. The second-order conic programming (SOCP) approach has been applied to address the quadratic constraints. The nonconvex feature of the OPF problem has been relaxed utilizing the McCormick envelopes. To find the minimum current of each branch, the lossless power flow model has been first solved and the obtained results have been considered for solving the OPF problem. The IEEE 33-bus test system has been selected as the benchmark to verify the efficient performance of the proposed OPF model. The simulation study confirms that the McCormick envelopes used in the QCP approach lead to precise results with a very fast convergence time. Overall, the presented model for the OPF can be extended for both planning and operation purposes in distribution system studies.
KW - Convex Optimization Model
KW - Distribution Network
KW - Optimal Power Flow
KW - Second-Order Conic Programming
UR - http://www.scopus.com/inward/record.url?scp=85126485430&partnerID=8YFLogxK
U2 - 10.1109/EEEIC/ICPSEurope51590.2021.9584627
DO - 10.1109/EEEIC/ICPSEurope51590.2021.9584627
M3 - Conference contribution
AN - SCOPUS:85126485430
T3 - 21st IEEE International Conference on Environment and Electrical Engineering and 2021 5th IEEE Industrial and Commercial Power System Europe, EEEIC / I and CPS Europe 2021 - Proceedings
BT - 21st IEEE International Conference on Environment and Electrical Engineering and 2021 5th IEEE Industrial and Commercial Power System Europe, EEEIC / I and CPS Europe 2021 - Proceedings
A2 - Leonowicz, Zbigniew M.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 21st IEEE International Conference on Environment and Electrical Engineering and 2021 5th IEEE Industrial and Commercial Power System Europe, EEEIC / I and CPS Europe 2021
Y2 - 7 September 2021 through 10 September 2021
ER -