Algorithms for renumbering nodes in distribution systems for fast computation of power flow

摘要

In general distribution systems, it is necessary to order the nodes sequentially for faster computation of power flow. Therefore, this paper presents two renumbering algorithms: the Longest Lateral (LL) method and the Lower Node (LN) method. These renumbering algorithms can determine the order of nodes uniquely for a Forward Sweep power flow method based on quadratic equations (FSQE). Results of tests show that the proposed methods reduce computation time compared to the Backward Forward Sweep (BFS) method based on Kirchhoffs law in large distribution systems. A comparison of renumbering methods is important because, once a renumbering scheme is completed, FSQE does not require it again. The execution times of the LL and LN methods are also evaluated and the possibility that the number of end nodes influences the renumbering time is denoted.