Fast Computation of Power Flow in Distribution Systems by Renumbering Nodes

Abstract

In general distribution systems, it is necessary to order the nodes sequentially for faster computation of power flow. For the purpose of that, Longest Lateral (LL) method and Lower Node (LN) method have already been proposed to execute Forward Sweep power flow method based on Quadratic Equations (FSQE) which takes advantage of sequentially numbered nodes. The aim of this paper is to verify the difference of the node renumbering methods on the FSQE method. The numerical results show that the FSQE method using node renumbering methods reduces computation time compared to the Backward Forward Sweep (BFS) method based on Kirchhoff's law in large distribution systems. This paper also includes discussions of determinant of computation time on power flow methods by multiple regression analysis. It is suggested that FSQE-LL method is effective against a system including many nodes and large loads. Additionally, FSQE-LN method is also effective against a system which is reconfigured frequently.