An innovative approach for solving the restoration problem in distribution networks

An effective heuristic graph-based approach is proposed in this paper for solving the service restoration problem in distribution networks. Minimisation of the de-energised consumers' load and reduction of the number of switching operations were considered in this service restoration application. A suitable assignment of the weighting coefficient to all branches in a de-energised area was used to decrease the number of switching operations. Prim's algorithm for finding of the minimum spanning tree logic was used to realise this approach. Other applications necessary for the optimal performance of the service restoration application were also developed and tested in this study (e.g., load flow, load reallocation of overloaded network elements, generation of the sequence of switch actions, etc.). (C) 2011 Elsevier B.V. All rights reserved.