Service Restoration Based on Dynamic Programming

Inhalt:
A new method is presented to restore the power system based on dynamic programming. After fault element isolation, the out-of service areas which composed by load nodes can be divided into several groups, each of which has one contact branch used for load transforming. According to the different restore order of the load nodes, the sequences of operations are produced, which can turn the problem of restore order into the problem of node-string choice. Based on dynamic programming method, each contact branch is calculated as one stage, the algorithm is designed to transfer and restore the largest load capacity by the optimal choice of the node-string. In each stage, the calculation process records the optimal state variable and lists the decision variable. The optimal result will be obtained at the last stage. This method can be used for power service reconfiguration when the power surplus capacity is not enough for all the out-of service nodes. The method has the advantages of reducing the time of power cut and improving the reliability of power supply. This paper introduces the basic principle of dynamic programming, and the design of the algorithm. The proposed method is validated by simulation results.