A Simple Approach for Branch Current Computation in Load Flow Analysis of Radial Distribution Systems

Abstract

The purpose of this paper is to expose students to a simple and efficient load flow algorithm for a radial distribution system (RDS). The basic structure and properties of the RDS are discussed, followed by an illustrative description of the load flow algorithm. The proposed load flow algorithm exploits the tree-type structure of the RDS and uses data structures efficiently. The flowchart and pseudo-codes of the algorithm have been included to help the students in writing their own program. The time and space complexity of the algorithm have also been discussed. The treatment and analysis will be useful for students' understanding of RDS, use of data structures in programming, and approximate complexity analysis of algorithms. The instructors can effectively use the contents of the paper for a basic lecture on RDS (PDF files of the Microsoft PowerPoint slides and C language program code can be downloaded from the website http://www1.mmu.edu.my/∼nirod/).

Load Flow Calculation For Electrical Power System Based On Run Length Encoding Algorithm

“……………………………… (4) …………………...……… (5) Note that buses classified as three types of buses (Slack (V& constants), Generated buses (P&V constants) and Load buses (P&Q constants). That mean, there are two iterations to solve this problem.…”

“…Firstly, it need internal iterations to calculated values of real and reactive power (2,3) when variables assumed (at beginning of solving method) or calculated (at process to achieved solution). Secondly, External iterations required to find power mismatch at tolerance (4,5), which mean increase precision will increased number of iterations. In this paper, First iteration will be called iterations for calculation while second iteration will be called iterations for accuracy.…”

“…Prasad suggested a simple algorithm for load flow analysis [5]. A new efficient load flow algorithm be modeled as graph and finally adjacency list is used for the efficient representation of Radial Distribution Network (RDN) in computer memory [6].…”

Faster load flow algorithm for radial distribution network using graph theory

“…A topological sort or topological ordering is a mechanism that provides linear ordering of all of the vertices of the graph, ie, if a graph contains a directed edge ( u , v ), then u appears before v in the ordering. Topological sort can be viewed as an ordering of its vertices along a horizontal line moving from left to right.…”

“…However, the associated demerit of these schemes is large number of recursive calls to calculate voltage, which renders it to be inefficient. Prasad et al proposed a simple algorithm for LFA . Here, authors exploit the tree properties with effective use of data structures.…”