Optimal restoration of distribution systems using dynamic programming

Raúl Pérez-Guerrero, Gerald Thomas Heydt, Nevida J. Jack, Brian K. Keel, Amindo R. Castelhano

Research output: Contribution to journalArticlepeer-review

128 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)1589-1596
Number of pages8
JournalIEEE Transactions on Power Delivery
Issue number3
StatePublished - Jul 2008


  • Distribution automation
  • Distribution systems
  • Dynamic programming (DP)
  • Service restoration

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering


Dive into the research topics of 'Optimal restoration of distribution systems using dynamic programming'. Together they form a unique fingerprint.

Cite this