Skip to Main Content
The reconfiguration of distribution networks is an important combinatorial problem. This work addresses the particular case of reconfiguration after an outage caused by the loss of a single branch of the network. The reconfiguration is carried out over two domains simultaneously: re-switching strategies and transformer tap-changer adjustments. The approach was tested using a real large-scale network within the concession area of Energy Australia. The model considers four operational elements: an AC power flow model, the network's radial topology when operating, voltage limits and load limits. Two evolutionary algorithms were implemented and tested. The first was a genetic algorithm, applied over the space of possible re-switching strategies, and for both re-switching and tap-changer adjustments, simultaneously. The second was a memetic algorithm, applied over the same two variations of the reconfiguration problem. Computational tests consider the evaluation of the loss of every branch, reporting the number of buses affected, and the number of overloaded branches after the reconfiguration.