 Research
 Open access
 Published:
An improved backward/forward sweep power flow method based on network tree depth for radial distribution systems
Journal of Electrical Systems and Information Technology volumeÂ 8, ArticleÂ number:Â 7 (2021)
Abstract
This paper presents an improved load flow technique for a modern distribution system. The proposed load flow technique is derived from the concept of the conventional backward/forward sweep technique. The proposed technique uses linear equations based on Kirchhoffâ€™s laws without involving matrix multiplication. The method can accommodate changes in network structure reconfiguration by involving the parentâ€“children relationship between nodes to avoid complex renumbering of branches and nodes. The IEEE 15 bus, IEEE 33 bus and IEEE 69 bus systems were used for testing the efficacy of the proposed technique. The meshed IEEE 15 bus system was used to demonstrate the efficacy of the proposed technique under network reconfiguration scenarios. The proposed method was compared with other load flow approaches, including CIM, BFS and DLF. The results revealed that the proposed method could provide similar power flow solutions with the added advantage that it can work well under network reconfiguration without performing node renumbering, not covered by others. The proposed technique was then applied in Tanzania electric secondary distribution network and performed well.
Introduction
Load flow analysis is a crucial task in power systems control as it helps in the computation of voltages at each node and currents at each branch [1]. The load flow method results carry important information about the power system; many analysis would not be possible without it. Applications of load flow methods reduce the needs for additional investments in sensors and communication infrastructure in power systems. Load flow results are included in various tools which monitor, analyze and control the power system. Load flow analysis is directly or indirectly used in various power system applications such as distributed generator and capacitor placements [2,3,4], economic dispatch [5, 6], power quality improvements, network reconfiguration and service restorations [7, 8], power systems optimization and other applications. Different load flow methods have been devised for power flow analysis in both distribution networks and transmission network. The power flow analysis commonly used in distribution networks includes backward/forward sweep (BFS) and direct load flow (DLF) methods. Newton Raphson method [9], Gauss [10] and fastdecoupled methods [11] are mostly used in power transmission systems.
The load flow methods used in a power transmission network may not work efficiently in distribution networks due to the high resistance (R) to reactance (X) ratio. Few researchers have tried to improve the NewtonRaphson method for the distribution networks applications; however, it has a high computation time [12]. The backward/forward sweep proposed by [13, 14] is efficient for power distribution systems; however, it requires node or branch renumbering when applied in operations that involve networks with dynamic topology structures (e.g., network reconfiguration problems) [15]. Such techniques work well for static networks where the network topology does not change, such as optimal distributed generation placement or capacitor placement in a radial distribution network [16]. Direct load flow method initially proposed by [17] is based on the computation of two matrices, namely branch injection branch current (BIBC) and branch current bus voltage (BCBV) and finally computation of DLF matrix, which is the multiplication of BIBC and BCBV. The DLF results in faster computational time as compared to the BFS method, but it also requires network renumbering during network reconfiguration.
Unlike [17] which involves two matrices for converting bus injection current to branch current in the backward sweep and conversion of branch current to bus voltages in the forward sweep, the study done by [18] proposed a technique that uses a single load current to bus voltage (LCBV) matrix to perform both backward and forward sweeps load flow calculations in a single step. The use of LCBV introduces flexibility, resulting in a load flow method that accommodates any change in network structure due to reconfiguration. However, its application in large systems may not be efficient due to the use of matrices arithmetic. Significant efforts have also been made to improve the BFS and eliminate the need for network renumbering due to the increased number of nodes from the original network. A study by [1] proposed an approach based on BFS in which the network renumbering is eliminated by identifying common nodes, terminal nodes and intermediate nodes followed by the construction of main and derivative matrices.
This paper proposes an improved BFS approach for power flow analysis in a radial distribution network. The strength of the proposed approach lies in its simplicity to implement and its independence on node renumbering and network reconfiguration. The proposed algorithm has alleviated node numbering dependence by taking advantage of the structure of a radial distribution network and the use of depth search concepts. Network reconfiguration is associated with the addition or removal of nodes or connection of multiple network segments. In such cases, a mechanism for restructuring one of the connecting networks without renumbering its nodes has been proposed and featured in the proposed load flow method to handle network reconfiguration problems.
The rest of this paper is organized as follows. â€śStudy justificationâ€ť section presents problem formulation and background information of Tanzania Electric Supply Company (TANESCO). â€śMethodsâ€ť section describes the theoretical background and mathematical presentations of the conventional backward/forward sweep load flow method,Â the proposed load flow method, network depth concepts, and techniques for handlingÂ network reconfiguration. â€śResults and discussionâ€ť sectionÂ presents results and discussion for considered cases and compares the proposed load flow method with other existing methods. â€śConclusionâ€ť section concludes this paper and highlights the areas for future works.
Study justification
Tanzania Electric Supply Company (TANESCO) Limited is the only company that deals with the generation, transmission and distribution of electricity in Tanzania. TANESCO owns the interconnection power grid made up of generation, transmission and distribution system [19]. According to [20], the TANESCOâ€™s transmission system comprises fiftyseven (57) substations interconnected by transmission lines and 11,124 distribution transformers with 17,021Â km of 33Â kV lines, 5,375 km of 11kv lines and over 34,513Â km of lowvoltage (LV) lines. This information justifies how vast is the distribution network as compared to the transmission network. The distribution network supplies electricity at two voltage levels, the medium voltage (MV) with 33Â kV or 11Â kV and LV with 380V for three phases and 230V for single phase. The MV is used at the primary distribution network, and LV is used at the secondary distribution network. Both primary and secondary distribution networks are operated radially. In Tanzania power system, the primary distribution network is automated but there is no automation in secondary distribution network [21,22,23,24].
The singleline diagram for the Tanzania secondary distribution network is shown in Fig.Â 1. The secondary distribution network comprises a three or a singlephase network with a neutral conductor. Single distribution transformers save loads in the secondary distribution networks; thus, a radial power flow analysis is used for identifying power system parameters. The secondary distribution network is not static as it grows as new customers are connected to the network. The data collected from the utility company in Tanzania from January 2015 to September 2019 has revealed the customersâ€™Â growth rate of 32% per year, as shown in Fig.Â 2. This growth rate is significant for the distribution network and has impacts on the load flow methods. The network growth cause changes in the topology due to network reconfiguration during service restoration and when new customers are added. Also, in such network, nodes are numbered arbitrarily.
Most of the available load flow methods, such as conventional BFS, DLF and CIM, depend on node numbering schemes. Other available methods involve partitioning the network and the use of matrices multiplications. Considering the distribution network dynamicity caused by network expansion and network growth, most of these available load flow methods may not be efficient. Also, considering the nature of primary and secondary distribution networks characterized by multiple connections with a large number of nodes, methods that involve matrices multiplications may be computationally ineffective. Power flow methods that can accommodate network reconfiguration without requiring node renumbering are essential for efficient power flow analysis in both primary and secondary distribution networks. Therefore, the improved power flow method in this paper forms the baseline for automating the power distribution networks.
Methods
Conventional backward/forward sweep method
The electric power distribution system is characterized by heavy loading conditions at some buses and a high R/X ratio, unbalanced load and mostly radial topology. Many power flow methods have been designed and proved to work efficiently for transmission systems [9,10,11]. However, the design assumptions considered for power flow methods in transmission networks are not suitable for power flow analysis in radial distribution networks due to their convergence, memory requirements and computational efficiency.
Load flow solution that fits the requirements for a radial distribution network has been proposed [25,26,27,28]. The backward/forward sweep (BFS) is among the most successfulÂ power flow methods for radial networks [29, 30]. The variants of BFS methods have been reported, such as the current summation method, power summation method and admittance summation method [13]. The basic operation principle of BFS involves two computation processes at each iteration. The backward process involves the power or current flow solutions starting from the branch of the end nodes moving toward the branch connected to the reference node. The forward sweep calculates the voltage at each node starting from the reference node to the end nodes. During the backward sweep, the voltage is held constant, and during the forward sweep, the current or power value is held constant [31, 32]. After each iteration, the power flow convergence is tested. The first step of BFS is a calculation of node/bus injection current which can be calculated using Eq.Â (1).
where \(\displaystyle I_i^{(k)}\) is the injection current at node i on iteration k, \(\displaystyle S_i\) is the power injection at node i and \(\displaystyle V_i^{(k1)}\) is the voltage of node i at iteration \(\displaystyle k1\).
The second step is the backward sweep which is performed using Eq.Â (2) starting from the last ordered branch from the root node.
where \(\displaystyle J_{i1,i}^{(k)}\) is the current of the branch connecting node i to its upstream node \(\displaystyle i1\) and \(\displaystyle \sum (J_{i,i+1}^{(k)}\) is the sum of all currents of branches emanating from node i.
The next step is forward sweep which calculates currents for each node using Eq.Â (3).
where \(\displaystyle V_{i}^{(k)}\) is the voltage of node i at iteration k and \(\displaystyle V_{i1}^{(k)}\) is the voltage of the immediate upstream node of node i, \(\displaystyle J_{i1,i}^{(k)}\) is the current of branch connecting node i to its immediate upstream node and \(\displaystyle Z_{i1,i}\) is the impedance of branch connecting node i to its immediate upstream node.
The most common stopping criteria for BFS are the convergence of voltage magnitudes obtained by tracking the differences of voltage magnitude between two successive iterations. The algorithm stops when the conditions in Eq.Â (4) are met.
where \(\displaystyle \alpha\) is the tolerance limits which, in this work, was set as \(\displaystyle \alpha =0.0001\).
Network depth in radial electrical distribution system
The nominal radial distribution system consists of nodes/buses which are connected by branches. The structure of such a system can be described as a tree [33]. There are three types of nodes in distribution systems: terminal nodes, intermediate nodes and common nodes. The common node refers to a junction node that connects more than three network segments, for example, node 2 and node 4 in Fig.Â 3. The terminal nodes are the endpoints of a network segment, for example, nodes 1, 6, 9 and 10 in Fig.Â 3. The intermediate nodes are the nodes between common nodes and end nodes, for example, node 3 and 7. The end node that connects the network to the power system is called the root/reference node. Loads and distributed generators can be connected to the nodes. However, there are nodes with no power consumption and no power injections; they are called zero injection nodes.
A distribution network can be modeled as a radial tree \(G=\left\{{V, E}\right\}\) with N nodes, where V is a set of vertices, or nodes/buses and E is a set of branches or edges [34]. In a radial distribution network, power flow is unidirectional, flowing from upstream to downstream buses. In that regard, power can flow from node i to node j via a branch which can be represented as branch/edge (i,Â j). The immediate upstream node for node i is a parent of node i, and the immediate downstream node of node i is a child of node i. Therefore, \(P_i\) is a set of all parents of node i, and \(C_i\) is a set of all children of node i. However, each node, except the root node, has just one parent for the radial distribution network. For example, from Fig.Â 3, the parent of node 4 is node 2 and children of node 4 are nodes 7, 8 and 9. The edge set that connects a node to its parent is called a parent edge, and a set of edges that connect a node to its children is called a children edge. Consider node 4 in Fig.Â 3, the parent edge is edge (2, 4), and children edges are edge (4, 7), (4, 8) and (4, 9). For every node i, the degree of node \(d_i\) is a total number of branches that directly connect to node i. The distance between any two nodes can be measured by the number of edges between the two nodes. For example, the distance between nodes 1 and 12 is 4 since there are four edges between them. Therefore, at this point, important variables in the proposed algorithm called a node depth \((D_n)\) and network depth (T) can be defined.
Definition 1
A node depth is the distance between a node and the root node
Definition 2
A depth of a network is the distance between the root node and the furthest node from the root node, i.e., \(\displaystyle T=\mathrm{Max}_{n\in V}(D_n)\)
Consider Fig.Â 3 and DefinitionÂ 1, node 6 and node 11 both are terminal nodes, but the depth of node 6 is 3, and the depth of node 11 is 4. Similarly, nodes 4 and 5 are of different types and belong to different network segments, but both have a depth of 2. The depth of the root node is 0. From definition 2, the depth of the network in Fig.Â 3 is 4.
Proposed backward/forward power flow method
The power flow methods provide current on each branch and voltages on each node as a solution. This solution can be noted as set \(S=\small \{H_n,I_b\}\), where \(H_n\) is a set of voltages of all nodes \(n={ 1,2\ldots N}\), \(I_b\) is a set of currents of all branches \(b={ 1,2\ldots B}\), with B being the number of branches. In the proposed method, in the backward sweep, each node finds the current of its parent edge using Kirchhoff current summation law and updates the solution set \(I_b\). In the forward sweep, each node calculates and updates voltage solution set \(H_n\) by accessing the voltage of its parent node, stored current and line data of its parent branch to get its new voltage value. The process of storing the currents and voltages performed at the nodes on each iteration is equivalent to memorization in dynamic programming. On each directional move, backward and forward, each node solves the same problem repeatedly, i.e., current summation and voltage subtraction, respectively, which signifies subproblem overlapping in dynamic programming. Since a solution for a large problem (power system network) is obtained by solving similar small problems on each node, it signifies that the substructure is optimal. Therefore, it is possible to solve the power flow problem using dynamic programming concepts.
The algorithm starts by setting the voltages for all nodes equal to nominal network voltage. In the backward sweep, the algorithm starts at depth \(D_i=T\) and traverses up the network to depth \(D_i=1\) by decreasing the depth by 1 after each iteration, i.e., traverses through all depths except depth 0. At each iteration k, the algorithm is at search depth \(D_k=Tk\). At each depth, all nodes belong to that depth are listed. Let that list at each depth be represented as \(Q_k=\left\{{n\in VD_k=0}\right\}\). At each depth and for each node \(q \in Q_k\), the Kirchhoffâ€™s current law is solved and update the solution set \(I_b\). In the forward sweep, the algorithm starts at a depth \(D_i=1\) and traverses down the network to depth \(D_i=T\), by increasing the depth by 1 after each iteration. At each iteration k, the algorithm is at search depth \(D_k=k\). At each depth and for each node \(q \in Q_k\), the voltage drop due to the parent branch of node q is found and subtracted from the voltage of its parent node and the solution set \(H_n\) is updated. This backward and forward sweep processes repeat until convergence criteria are met. The flowchart of the proposed algorithm is presented in Fig.Â 4.
It should be noted that unlike many other proposed solutions in the literature, in the implementation of the proposed algorithm, there is no need to classify or partition the network into main and derivation lines or any use of matrices multiplication. The solutions are obtained by simply adding and subtracting voltages and currents. Also, the proposed method is independent of the numbering and naming of the nodes since the nodes interact by parentâ€“children relationship. Once the node knows its parent or children, it can also automatically get their names and addresses in the solution set \(S=\{H_n,I_b\}\).
Network information reorganization for changing network topology
In some applications which involve network reconfiguration through switching operations due to line failure, phase balancing, system isolation and restoration, nodes or network segment can be added or removed or changed its connection points. In such a dynamic network, the direction of power flow for some branches may change, and the parentâ€“children relationship may also change. Consider Fig.Â 5, initially Switch A is closed and switch B is opened. Then, node 3 is the parent of node 11 and 11 is a parent of 12. By opening Switch A and closing Switch B, the path of some nodes toward root nodes and the parentâ€“children relationship of some nodes changes such that node 11 becomes a parent of node 3 and node 12 becomes a parent of node 11.
Since the proposed algorithm is based on the parentâ€“children relationship, then network data restructuring is required for good performance of the algorithm. Network data restructuring involves updating the network data as a result of reconfiguration. Steps used to update network data are elaborated in TableÂ 1.
Consider meshed IEEE 15 bus system in Fig.Â 5; Switch C separates two network segments starting from Substation A and Substation B. When connecting the two networks, one substation is disconnected. Let the network segment connected to the substation be called the source network segment, and the network connected to the source segment called the new network segment. Since each segment consists of different nodes, their connection may result in several possible configurations depending on the type of nodes involved as a connection point from each network segment. Examples of such configurations include connections that involve the end node from the source segment and end node from the new segment, i.e., node 5 and 34, an intermediate node of the source network and the end node of the new network, i.e., node 3 and 33, and so on. The flowchart of the proposed BFS power flow method that can efficiently handle all possible connection scenarios due to network reconfiguration, without renumbering of nodes, is presented in Fig. 6 and the Pseudocode of the same algorithm is presented in Algorithm 1.
Results and discussion
In this work, simulations were conducted in three parts. In the first part, the simulation was conducted using IEEE standard buses to test the accuracy of the proposed algorithm by comparing it with other studied algorithms. In the second part, simulations were conducted in a meshed IEEE 15 bus to test the capability of the proposed algorithm in handling network reconfiguration cases. The third part is the simulation of the application of the proposed algorithm in a practical electrical secondary distribution network. All simulations were carried out using MATLAB 2017b on 3.80Â GHz 4 Cores core i7 computer with 16GB RAM.
Results for IEEE Bus Systems
The IEEE 15 bus system has been selected as the test system to test the robustness of the proposed algorithm. The line data and load data for IEEE 15 bus are presented in TablesÂ 2 and 3, respectively. The singleline diagram of IEEE 15 bus system network topology is presented in Fig.Â 7. In this study, three types of popular load flow methods, namely current injection method (CIM), BFS [1], DLF [17], were used to validate the proposed load flow method. The CIM results were taken from a study conducted by [1], and results for BFS and DLF were obtained from conducted simulations. The load flow results, which show the absolute voltages on the nodes for IEEE 15 bus system, are presented in TableÂ 4. Results in TableÂ 4 show that the proposed load flow method obtained similar voltage profiles to DLF and BFS on all nodes. The results for CIM seem to differ from the rest of the methods.
Another test was conducted using the IEEE 33 bus system whose line data and load data were taken from [35, 36]. In this study, two types of popular load flow methods, namely BFS and DLF, were used to validate the proposed load flow method. The load flow results, which show the absolute voltages on the IEEE 33 bus system nodes, are presented graphically in Fig.Â 8. Results in Fig.Â 8 show that the proposed load flow method obtained similar voltage profiles to DLF and BFS on all nodes.
Another test was conducted using the IEEE 69 bus system whose line data and load data were taken from [37]. In this study, three types of popular load flow methods, namely CIM, BFS and DLF, were used to validate the proposed load flow method. The load flow results that show the absolute voltages on the IEEE 69 bus system nodes are presented graphically in Fig.Â 9. Results in Fig.Â 9 show that the proposed load flow method obtained similar voltage profiles to DLF and BFS on all nodes with some deviations from CIM at the far end nodes. Also, the number of iterations for different bus systems is presented in TableÂ 5, and the average computational time per iteration after 100 runs is presented in TableÂ 6.
From presented results for IEEE 15 bus, 33 bus and 69 bus systems, it is evident that the proposed method is efficient in solving power flow problems as it has been able to obtain similar power flow solutions as BFS and DLF with an added advantage of its efficiency in dynamic radial networks. Also, the number of iterations for the proposed load flow method is equal to DLF and BFS for all considered cases.
TableÂ 6 shows that for all tested power systems, the DLF is the fastest, but it involves complex matrices arithmetic which affects its performance in large system applications. For IEEE 33 bus, the proposed method has outperformed the BFS, but for IEEE 69 bus, the BFS performed better than the proposed method. The results show that the speed performance of the proposed algorithm decreases as the network grows relative to BSF, due to additional computational on the proposed algorithm to alleviate algorithmsâ€™ dependence on node renumbering. For power loss comparison, all algorithms attained loss of around 211.0581 for IEEE 33 bus system and loss of around 238.6734 for IEEE 69 bus system, and no significant difference was observed
Results for network reconfiguration problems
The study to test the efficiency of the proposed load flow method in handling network reconfiguration problems was conducted using meshed IEEE 15 bus system. In this study, two 15 bus systems with different numbering style were combined via tie switch (Switch C) as seen in Fig.Â 5. The first bus system, called network 1, was the one that was connected to the substation. The numbering of the first bus system (network 1) was retained, and that for the second bus system (network 2) was done randomly to verify that the independence of the proposed algorithm on node numbering. The connection between the two networks was made using a switch. The line segment with an impedance of \(1+1j\) was used as a switch between two connecting nodes. Changing network configuration was achieved by changing the position of the switch. Simulations were then conducted for different network topology with different switch positions. Four switch positions were considered for demonstrations, namely when bus 30 of network 2 connected to bus 2 of network 1, bus 14 of network 2 connected to bus 35 of network 1, bus 5 of network 2 connected to bus 23 of network and bus 13 of network 2 connected to bus 28 of network 1. Power flow results for different network configurations are presented in Fig.Â 10 and TableÂ 7.
Results for Tanzanian secondary distribution network
The proposed algorithm has also been tested in the secondary distribution network segment that comprises 79 nodes. The network has 143 Residential customers. In this network, the active peak load was 190KW, and the reactive peak load was 142.5Â KVar. The distribution transformer has a base voltage of 0.4Â k and 0.315Â MVA. Node numbering was acquired from TANESCO GIS System. To preserve space, only sample load data and line data for Tanzanian secondary distribution network are presented in TablesÂ 8 and 9. The load flow results for this network are presented in Fig.Â 11. The presented results show that the proposed load flow method can effectively handle power flow problems in dynamic lowvoltage power systems.
Conclusion
In a power system, the distribution network is very dynamic in size due to new customers and new nodes added to the network. In such situations, most conventional load flow methods are not efficient in solving load flow problems since they require complex node renumbering. In this paper, a new load flow method based on the backward/forward sweep concept has been used to solve load flow problems in both medium and lowvoltage distribution systems. Unlike other studied load flow methods like BFS and DLF, the proposed method does not require any complex renumbering of nodes or matrices calculations; it only uses linear Kirchhoffâ€™s rules and the parentâ€“children relationship between nodes and depth search mechanisms.
The proposed algorithms have been compared with popular load flow methods such as CIM, BFS and DLF. The results show that the proposed method has obtained similar power flow solutions as BFS and DLF, which proves its efficiency in solving power flow problems. Also, the proposed algorithm has shown its efficacy in handling network configuration problems without node renumbering. The proposed algorithm has efficiently performed when tested using data from a practical Tanzania electric power system with arbitrary numbering. Therefore, we propose using the proposed load flow method for medium and lowvoltage radial distribution systems.
The proposed load flow method in this paper compliments the traditional BFS method to alleviate the dependence on node numbering and increase the usability of these methods in power system applications. However, further researches are required to improve the computational time of the proposed algorithm. Further studies on the performance of the proposed algorithms in other radial distribution network are also required.
Availability of data and materials
All data generated or analyzed during this study are included in this published article.
Abbreviations
 BCBV:

Branch current bus voltage
 BFS:

Backward/forward sweep
 BIBC:

Branch injection branch current
 CIM:

Current injection method
 DLF:

Direct load flow methods
 LCBV:

Load current to bus voltage
 LV:

Low voltage
 MV:

Medium voltage
 TANESCO:

Tanzania Electric Supply Company
References
Ouali S, Cherkaoui A (2020) An improved backward/forward sweep power flow method based on a new network information organization for radial distribution systems. J Electr Comput Eng 2020:5643410
Kawambwa S, Hamisi N, Mafole P, Kundaeli H (2021) A cloud model based symbiotic organism search algorithm for DG allocation in radial distribution network. Evolut Intell 1â€“18
Manikanta G, Mani A, Singh H, Chaturvedi D (2019) Simultaneous placement and sizing of DG and capacitor to minimize the power losses in radial distribution network. In: Ray K, Sharma T, Rawat S, Saini R, Bandyopadhyay A (eds) Soft computing: theories and applications. Springer, Singapore, pp 605â€“618
Sujatha M, Roja V, Prasad TN (2019) Multiple dg placement and sizing in radial distribution system using genetic algorithm and particle swarm optimization. In: Computational intelligence and big data analytics. Springer, pp 21â€“36
RizkAllah RM, ElSehiemy RA, Wang GG (2018) A novel parallel hurricane optimization algorithm for secure emission/economic load dispatch solution. Appl Soft Comput 63:206â€“222
ElSehiemy RA, RizkAllah RM, Attia AF (2019) Assessment of hurricane versus sinecosine optimization algorithms for economic/ecological emissions load dispatch problem. Int Trans Electr Energy Syst 29(2):2716
Hamida IB, Salah SB, Msahli F, Mimouni MF (2018) Optimal network reconfiguration and renewable DG integration considering time sequence variation in load and DGs. Renew Energy 121:66â€“80
Pegado R, Naupari Z, Molina Y, Castillo C (2019) Radial distribution network reconfiguration for power losses reduction based on improved selective BPSO. Electr Power Syst Res 169:206â€“213
Abbasbandy S (2003) Improving Newtonâ€“Raphson method for nonlinear equations by modified Adomian decomposition method. Appl Math Comput 145(2â€“3):887â€“893
Teng JH (2002) A modified Gaussâ€“Seidel algorithm of threephase power flow analysis in distribution networks. Int J Electr Power Energy Syst 24(2):97â€“102
Lin WM, Teng JH (2000) Threephase distribution network fastdecoupled power flow solutions. Int J Electr Power Energy Syst 22(5):375â€“380
Sereeter B, Vuik K, Witteveen C (2017) Newton power flow methods for unbalanced threephase distribution networks. Energies 10(10):1658
Rupa JM, Ganesh S (2014) Power flow analysis for radial distribution system using backward/forward sweep method. Int J Electr Comput Electron Commun Eng 8(10):1540â€“1544
Jabari F, Sohrabi F, Pourghasem P, MohammadiIvatloo B (2020) Backwardforward sweep based power flow algorithm in distribution systems. In: Pesaran Hajiabbas M, MohammadiIvatloo B (eds) Optimization of power system problems. Springer, Berlin, pp 365â€“382
Aman MM, Jasmon GB, Abu Bakar AH, Mokhlis H, Naidu K (2016) Graph theorybased radial load flow analysis to solve the dynamic network reconfiguration problem. Int Trans Electr Energy Syst 26(4):783â€“808
Bharti D, De M (2020) Comparison of optimal DG placement in radial distribution system using centrality index. In: Singh S, Pandey R, Panigrahi B, Kothari D (eds) Advances in power and control engineering. Springer, Berlin, pp 119â€“131
Teng JH (2003) A direct approach for distribution system load flow solutions. IEEE Trans Power Deliv 18(3):882â€“887
Ghatak U, Mukherjee V (2017) An improved load flow technique based on load current injection for modern distribution system. Int J Electr Power Energy Syst 84:168â€“181
Joseph R, Mvungi N (2014) Concept of automation in management of electric power systems. World Acad Sci Eng Technol Int J Electr Comput Energ Electron Commun Eng 8(12):1596â€“1600
(TANESCO), T.E.S.C.L.: Transmission. Tanzania Electric Supply Company Limited (2020). http://www.tanesco.co.tz/index.php/aboutus/functions/transmission
Mwifunyi RJ, Kissaka MM, Mvungi NH (2019) Distributed approach in fault localisation and service restoration: stateoftheart and future direction. Cogent Eng 6(1):1628424
Mnyanghwalo D, Kawambwa S, Mwifunyi R, Gilbert GM, Makota D, Mvungi N (2018) Fault detection and monitoring in secondary electric distribution network based on distributed processing. In: 2018 twentieth international Middle east power systems conference (MEPCON). IEEE, pp 84â€“89
Andegelile Y, Chugulu G, Bitebo A, Mbembati H, Kundaeli H (2019) Enhancing faults monitoring in secondary electrical distribution network. In: International conference on social implications of computers in developing countries. Springer, pp 712â€“723
Chugulu G, Simba F (2019) Communication architecture for automatic faults detection and clearance in secondary distribution power grid: the case of Tanesco. In: 2019 IEEE 7th international conference on smart energy grid engineering (SEGE). IEEE, pp 223â€“229
Parasher R (2014) Load flow analysis of radial distribution network using linear data structure. arXiv preprint arXiv:1403.4702
Singh S, Singh V, Ranjan R, Swapnil S (2019) Advanced load flow analysis for unbalanced radial distribution system incorporating weather conditions. J Inst Eng India Ser B 100(6):551â€“560
Vasquez WA, Quilumba FL (2016) Load flow method for radial distribution systems with distributed generation using a dynamic data matrix. In: 2016 IEEE Ecuador technical chapters meeting (ETCM). IEEE, pp 1â€“5
Bompard E, Carpaneto E, Chicco G, Napoli R (2000) Convergence of the backward/forward sweep method for the loadflow analysis of radial distribution systems. Int J Electr Power Energy Syst 22(7):521â€“530
Issicaba D, Coelho J (2016) Evaluation of the forwardbackward sweep load flow method using the contraction mapping principle. Int J Electr Comput Eng 6(6):3229
Eminoglu U, Hocaoglu MH (2008) Distribution systems forward/backward sweepbased power flow algorithms: a review and comparison study. Electr Power Compon Syst 37(1):91â€“110
Sunisith S, Meena K (2014) Backward/forward sweep based distribution load flow method. Int Electr Eng J 5(9):1539â€“1544
Rana A, Darji J, Pandya M (2014) Backward/forward sweep load flow algorithm for radial distribution system. Int J Sci Res Dev 2(1):398â€“400
Hong H, Hu Z, Guo R, Ma J, Tian J (2017) Directed graphbased distribution network reconfiguration for operation mode adjustment and service restoration considering distributed generation. J Modern Power Syst Clean Energy 5(1):142â€“149
Samudrala AN, Amini MH, Kar S, Blum RS (2019) Sensor placement for outage identifiability in power distribution networks. IEEE Trans Smart Grid 11(3):1996â€“2013
Baran ME, Wu FF (1989) Network reconfiguration in distribution systems for loss reduction and load balancing. IEEE Power Eng Rev 9(4):101â€“102
Kashem M, Ganapathy V, Jasmon G, Buhari M (2000) A novel method for loss minimization in distribution networks. In: DRPT2000. International conference on electric utility deregulation and restructuring and power technologies. Proceedings (Cat. No. 00EX382). IEEE, pp 251â€“256
Das D (2008) Optimal placement of capacitors in radial distribution system using a fuzzyGA method. Int J Electr Power Energy Syst 30(6â€“7):361â€“367
Acknowledgements
Not applicable.
Funding
Not applicable (no funding received for the research reported).
Author information
Authors and Affiliations
Contributions
SK proposed the idea and mainly involved in coding, designing the algorithm and manuscript compilation. RM was involved in designing the algorithm and presentation of results and discussion. DM performed Literature review and editing the manuscript. NH performed Literature Review and proof reading. EK was involved in editing the article including interpretation of the results to form the tables and figures. NM supervised the manuscript. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Kawambwa, S., Mwifunyi, R., Mnyanghwalo, D. et al. An improved backward/forward sweep power flow method based on network tree depth for radial distribution systems. Journal of Electrical Systems and Inf Technol 8, 7 (2021). https://doi.org/10.1186/s43067021000310
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s43067021000310