Comparative study of modern heuristic algorithms to service restoration in distribution systems

Sakae Toune; Hiroyuki Fudo; Takamu Genji; Yoshikazu Fukuyama; Yosuke Nakanishi

doi:10.1109/61.974205

Comparative study of modern heuristic algorithms to service restoration in distribution systems

Sakae Toune, Hiroyuki Fudo, Takamu Genji, Yoshikazu Fukuyama, Yosuke Nakanishi

Research output: Contribution to journal › Article › peer-review

200 Citations (Scopus)

Abstract

This paper presents a comparative study for four modern heuristic algorithms (MHAs) to service restoration in distribution systems: reactive tabu search, tabu search, parallel simulated annealing, and genetic algorithm. Since service restoration is an emergency control in distribution control centers to restore out-of-service areas as soon as possible, it requires fast computation and high quality solutions for customers' satisfaction. The problem can be formulated as a combinatorial optimization problem to divide the out-of-service area to each power source. The effectiveness of the MHAs is compared against each other on typical service restoration problems.

Original language	English
Pages (from-to)	173-181
Number of pages	9
Journal	IEEE Transactions on Power Delivery
Volume	17
Issue number	1
DOIs	https://doi.org/10.1109/61.974205
Publication status	Published - 2002 Jan 1
Externally published	Yes

Keywords

Combinatorial optimization
Distribution systems
Genetic algorithm
Modern heuristic algorithms
Parallel simulated annealing
Reactive tabu search
Service restoration
Tabu search

ASJC Scopus subject areas

Energy Engineering and Power Technology
Electrical and Electronic Engineering

Access to Document

10.1109/61.974205

Cite this

@article{1c2f9faeeb8042fdafd589686dec5e6a,

title = "Comparative study of modern heuristic algorithms to service restoration in distribution systems",

abstract = "This paper presents a comparative study for four modern heuristic algorithms (MHAs) to service restoration in distribution systems: reactive tabu search, tabu search, parallel simulated annealing, and genetic algorithm. Since service restoration is an emergency control in distribution control centers to restore out-of-service areas as soon as possible, it requires fast computation and high quality solutions for customers' satisfaction. The problem can be formulated as a combinatorial optimization problem to divide the out-of-service area to each power source. The effectiveness of the MHAs is compared against each other on typical service restoration problems.",

keywords = "Combinatorial optimization, Distribution systems, Genetic algorithm, Modern heuristic algorithms, Parallel simulated annealing, Reactive tabu search, Service restoration, Tabu search",

author = "Sakae Toune and Hiroyuki Fudo and Takamu Genji and Yoshikazu Fukuyama and Yosuke Nakanishi",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/61.974205",

language = "English",

volume = "17",

pages = "173--181",

journal = "IEEE Transactions on Power Delivery",

issn = "0885-8977",

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

number = "1",

}

TY - JOUR

T1 - Comparative study of modern heuristic algorithms to service restoration in distribution systems

AU - Toune, Sakae

AU - Fudo, Hiroyuki

AU - Genji, Takamu

AU - Fukuyama, Yoshikazu

AU - Nakanishi, Yosuke

PY - 2002/1/1

Y1 - 2002/1/1

N2 - This paper presents a comparative study for four modern heuristic algorithms (MHAs) to service restoration in distribution systems: reactive tabu search, tabu search, parallel simulated annealing, and genetic algorithm. Since service restoration is an emergency control in distribution control centers to restore out-of-service areas as soon as possible, it requires fast computation and high quality solutions for customers' satisfaction. The problem can be formulated as a combinatorial optimization problem to divide the out-of-service area to each power source. The effectiveness of the MHAs is compared against each other on typical service restoration problems.

AB - This paper presents a comparative study for four modern heuristic algorithms (MHAs) to service restoration in distribution systems: reactive tabu search, tabu search, parallel simulated annealing, and genetic algorithm. Since service restoration is an emergency control in distribution control centers to restore out-of-service areas as soon as possible, it requires fast computation and high quality solutions for customers' satisfaction. The problem can be formulated as a combinatorial optimization problem to divide the out-of-service area to each power source. The effectiveness of the MHAs is compared against each other on typical service restoration problems.

KW - Combinatorial optimization

KW - Distribution systems

KW - Genetic algorithm

KW - Modern heuristic algorithms

KW - Parallel simulated annealing

KW - Reactive tabu search

KW - Service restoration

KW - Tabu search

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

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

U2 - 10.1109/61.974205

DO - 10.1109/61.974205

M3 - Article

AN - SCOPUS:0036120941

VL - 17

SP - 173

EP - 181

JO - IEEE Transactions on Power Delivery

JF - IEEE Transactions on Power Delivery

SN - 0885-8977

IS - 1

ER -

Comparative study of modern heuristic algorithms to service restoration in distribution systems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this