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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power delivery 2002-10, Vol.17 (4), p.1070-1078
Main Authors: Young-Jae Jeon, Jae-Chul Kim, Jin-O Kim, Joong-Rin Shin, Lee, K.Y.
Format: Article
Language:English
Subjects:
Algorithms
Combinatorial analysis
Computational modeling
Cooling
Cooling systems
Cost function
Genetic algorithms
Intelligent networks
Large-scale systems
Minimization methods
Optimization
Schedules
Scheduling
Searching
Simulated annealing
Switches
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0885-8977
1937-4208
DOI:10.1109/TPWRD.2002.803823