Optimal Restoration of Distribution Systems Using Dynamic Programming

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper solves the distribution system restoration problem using dynamic programming with state reduction. The algorithm is an operator-permissive, automated approach to the restoration of distribution systems after a blackout. The timing and selection of feeders to be energized are represented as states in a dynamic programming formulation. An enhanced dynamic programming method reduces the number of states by grouping states that are close to each other and selecting the best state. The algorithm was tested on an 8 feeder/32 load distribution system. The method is applicable to radially configured systems. </para>