A modified backward/forward sweep-based method for reconfiguration of unbalanced distribution networks

Abstrak

A three-phase unbalanced power flow method can provide a more realistic scenario of how distribution networks operate. The backward/forward sweep-based power flow method (BF-PF) has been used for many years as an important computational tool to solve the power flow for unbalanced and radial power systems. However, some of the few available research tools produce many errors when they are used for network reconfiguration because the topology changesafter multiple switch actions and the nodes are disorganized continually. This paper presents a modifiedBF-PF for three-phase unbalanced radial distribution networks that is capable of arranging the system topology when reconfiguration changes the branch connections. A binary search is used to determine the connections between nodes, allowing the algorithm to avoid those problems when reconfiguration is carried out, regardless of node numbers. Tests are made to verify the usefulness of the proposed algorithm in both the IEEE 13-node test feeder and the 123-node test feeder, converging in every run where constraints are accomplished. This approach can be used easily for a large-scale feeder network reconfiguration. The full version of this modified backward/forward sweep algorithm is available for research at MathWorks.