Optimal Restoration of Distribution Systems Using Dynamic Programming

Author

Perez-Guerrero, R. ; Heydt, G.T. ; Jack, N.J. ; Keel, B.K. ; Castelhano, A.R.

Author_Institution

Arizona State Univ., Tempe, AZ

Volume

23

Issue

3

fYear

2008

fDate

7/1/2008 12:00:00 AM

Firstpage

1589

Lastpage

1596

Abstract

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.

Keywords

distribution networks; dynamic programming; distribution systems; dynamic programming; optimal restoration; state reduction; Automation; Content addressable storage; Dynamic programming; Guidelines; Lifting equipment; Power engineering and energy; Power system dynamics; Power system restoration; System testing; Timing; Distribution automation; distribution systems; dynamic programming (DP); service restoration;

fLanguage

English

Journal_Title

Power Delivery, IEEE Transactions on

Publisher

ieee

ISSN

0885-8977

Type

jour

DOI

10.1109/TPWRD.2007.916112

Filename

4488199