Algorithms for distribution feeder reconfiguration

Power distribution systems typically have a radial configuration. Sectionalizing switches along a feeder and interfeeder tie switches are used to maintain a radial structure. For every switch closed, another switch is opened, resulting in a new system configuration. To date, few algorithms and data structures have been proposed. In this paper, distribution system buses and sections are represented as adjacency and incidence matrices. Three algorithms are presented for reconfiguration. The first determines the admittance matrix for a feeder. The second algorithm performs a branch exchange between two feeders, ensuring no loads are left disconnected from the system, and that the systems´s radial configuration is maintained. A third algorithm updates system data for the new configuration