Improved Laplacian Matrix based power flow solver for DC distribution networks

Abstract

Distribution networks feature distinct topologies than transmission networks, such as radial or weakly meshed structures with tens of thousands of nodes. They have more points of power injection owing to the integration of distributed generators and high R/X ratios. Furthermore, there has recently been a surge of interest in DC distribution networks. In the planning and operation of modern distribution systems, load flow needs to be executed in series considering short intervals of time in the order of minutes or even less. Hence, these networks require a load flow solver that can converge fast with low computational burden. In this paper, we propose a unique iterative power flow solver based on graph theory for DC distribution networks. The proposed formulation is flexible and can handle both radial and mesh configurations with just one connectivity matrix. To validate the proposed method, we used the IEEE 33 bus test feeder and compared the results with an existing methodology. Results suggest that the proposed method is robust and possesses fast convergence.

Keywords

• DC distribution networks
• DC loads
• Fast convergence
• Graph theory
• Meshed networks
• Laplacian Matrix