Access the full text.
Sign up today, get DeepDyve free for 14 days.
This paper presents an efficient power flow (PF) for distribution networks (DN). The proposed PF method uses basic circuit laws in deriving the final PF expression and appears like the classical Gauss-Seidel PF algorithm of transmission systems. It possesses the advantages of forward and backward sweeps (FBS) based PF methods but avoids the FBS and formation of a Jacobian matrix. It primarily depends on a constant transformation matrix, formed only once from the network topology and feeder parameters. The transformation matrix relates the node currents with effective feeder voltage drops, and helps to compute the node voltages directly from the given set of load powers. The proposed PF was studied on 15, 33 and 69 node DNs, and the study exhibited that the performances in terms of accuracy, robustness to different r/x ratios of distribution lines and computational efficiency of the proposed method are superior to those of existing methods.
Technology and Economics of Smart Grids and Sustainable Energy – Springer Journals
Published: Feb 23, 2022
Keywords: Distribution power flow; Forward and backward sweeps; Compensation based power flow; Distribution management systems
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.