A fixed-point current injection power flow for electric distribution systems using Laurent series

Journal Article (2022)
Author(s)

Juan S. Giraldo (University of Twente)

Oscar Danilo Montoya (District University Francisco José de Caldas, The Technological University of Bolivar)

Pedro Vergara-Barrios (TU Delft - Intelligent Electrical Power Grids)

Federico Milano (University College Dublin)

Research Group
Intelligent Electrical Power Grids
Copyright
© 2022 Juan S. Giraldo, Oscar Danilo Montoya, P.P. Vergara Barrios, Federico Milano
DOI related publication
https://doi.org/10.1016/j.epsr.2022.108326
More Info
expand_more
Publication Year
2022
Language
English
Copyright
© 2022 Juan S. Giraldo, Oscar Danilo Montoya, P.P. Vergara Barrios, Federico Milano
Research Group
Intelligent Electrical Power Grids
Volume number
211
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

This paper proposes a new power flow (PF) formulation for electrical distribution systems using the current injection method and applying the Laurent series expansion. Two solution algorithms are proposed: a Newton-like iterative procedure and a fixed-point iteration based on the successive approximation method (SAM). The convergence analysis of the SAM is proven via the Banach fixed-point theorem, ensuring numerical stability, the uniqueness of the solution, and independence on the initializing point. Numerical results are obtained for both proposed algorithms and compared to well-known PF formulations considering their rate of convergence, computational time, and numerical stability. Tests are performed for different branch R/X ratios, loading conditions, and initialization points in balanced and unbalanced networks with radial and weakly-meshed topologies. Results show that the SAM is computationally more efficient than the compared PFs, being more than ten times faster than the backward–forward sweep algorithm.