An efficient simulated annealing algorithm for network reconfiguration in large-scale distribution systems

This paper presents an efficient algorithm for loss minimization by using an automatic switching operation in large-scale distribution systems. Simulated annealing is particularly well suited for a large combinatorial optimization problem since it can avoid local minima by accepting improvements in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on power delivery Jg. 17; H. 4; S. 1070 - 1078
Hauptverfasser: Young-Jae Jeon, Jae-Chul Kim, Jin-O Kim, Joong-Rin Shin, Lee, K.Y.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.10.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:0885-8977, 1937-4208
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents an efficient algorithm for loss minimization by using an automatic switching operation in large-scale distribution systems. Simulated annealing is particularly well suited for a large combinatorial optimization problem since it can avoid local minima by accepting improvements in cost. However, it often requires a meaningful cooling schedule and a special strategy, which makes use of the property of distribution systems in finding the optimal solution. In this paper, we augment the cost function with the operation condition of distribution systems, improve the perturbation mechanism with system topology, and use the polynomial-time cooling schedule, which is based on the statistical calculation during the search. The validity and effectiveness of the proposed methodology is demonstrated in the Korea Electric Power Corporation's distribution system.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0885-8977
1937-4208
DOI:10.1109/TPWRD.2002.803823