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

doi:10.1109/TPWRD.2007.916112

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 journal › Article › peer-review

128 Scopus citations

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.

Original language	English (US)
Pages (from-to)	1589-1596
Number of pages	8
Journal	IEEE Transactions on Power Delivery
Volume	23
Issue number	3
DOIs	https://doi.org/10.1109/TPWRD.2007.916112
State	Published - Jul 2008

Keywords

Distribution automation
Distribution systems
Dynamic programming (DP)
Service restoration

ASJC Scopus subject areas

Energy Engineering and Power Technology
Electrical and Electronic Engineering

Access to Document

10.1109/TPWRD.2007.916112

Cite this

@article{cb219f3642a647139401aee410cbe26d,

title = "Optimal restoration of distribution systems using dynamic programming",

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 automation, Distribution systems, Dynamic programming (DP), Service restoration",

author = "Ra{\'u}l P{\'e}rez-Guerrero and Heydt, {Gerald Thomas} and Jack, {Nevida J.} and Keel, {Brian K.} and Castelhano, {Amindo R.}",

year = "2008",

month = jul,

doi = "10.1109/TPWRD.2007.916112",

language = "English (US)",

volume = "23",

pages = "1589--1596",

journal = "IEEE Transactions on Power Delivery",

issn = "0885-8977",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Optimal restoration of distribution systems using dynamic programming

AU - Pérez-Guerrero, Raúl

AU - Heydt, Gerald Thomas

AU - Jack, Nevida J.

AU - Keel, Brian K.

AU - Castelhano, Amindo R.

PY - 2008/7

Y1 - 2008/7

N2 - 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.

AB - 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.

KW - Distribution automation

KW - Distribution systems

KW - Dynamic programming (DP)

KW - Service restoration

UR - http://www.scopus.com/inward/record.url?scp=47149093355&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47149093355&partnerID=8YFLogxK

U2 - 10.1109/TPWRD.2007.916112

DO - 10.1109/TPWRD.2007.916112

M3 - Article

AN - SCOPUS:47149093355

VL - 23

SP - 1589

EP - 1596

JO - IEEE Transactions on Power Delivery

JF - IEEE Transactions on Power Delivery

SN - 0885-8977

IS - 3

ER -

Optimal restoration of distribution systems using dynamic programming

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this