A new power flow method for radial networks

The need of fast algorithms for radial distribution networks that take advantage of their particular structure has been increasing, namely due to the use of genetic algorithms and meta-heuristics for optimization in planning and operation. In this paper, a new method for power flow calculation in radial networks is presented. It uses an iterative process along the branches, in a way similar to other methods, but the main idea is very different from previous approaches, since it is based on the exact power flow solution for a single branch and also because it provides a complete solution (not only voltage magnitudes). The method is fast and robust for different types of networks and loads, including heavy loads. The paper includes the theoretical derivation of the method, an illustration example and tests with benchmarking networks.