A REFINED BRANCH-EXCHANGE ALGORITHM FOR DISTRIBUTION NETWORKS RECONFIGURATION

Peng Bi

Proceedings of the Csee · 2001 · 18 citations · 0 references

Concepts

Abstract

A distribution networks reconfiguration algorithm which can achieve several independent topology restructure in a search is proposed. For these tie switches whose ideal efficiency of reconfiguration exceed specified value, the optimum topology restructure are determined by calculating the distance from the ideal transferred load to the loads transferred and the lowest distance is considered the best for loss reduction. Topology restructure is discarded when the efficiency of reconfiguration is less than specified value, thus, worthless topology restructure for practical purpose can be avoided. Not all branches can being exchanged is considered. Results show that the proposed algorithm is feasible.