2002
DOI: 10.1109/mper.2002.4312424
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Simulated Annealing Algorithm for Network Reconfiguration in Large-Scale Distribution Systems

Abstract: Abstract-This paper presents an efficient algorithm for loss minimization by using an automatic switching operation in largescale 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 c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
74
0
2

Year Published

2005
2005
2019
2019

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 76 publications
(76 citation statements)
references
References 14 publications
0
74
0
2
Order By: Relevance
“…Step 5: Update the bus voltage using Equation (10), where no_load V is the no-load voltage at each bus, that is:…”
Section: Power Flow Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Step 5: Update the bus voltage using Equation (10), where no_load V is the no-load voltage at each bus, that is:…”
Section: Power Flow Algorithmmentioning
confidence: 99%
“…Civanlar et al [9] proposed a branch-exchange method to minimize the number of switching operations; however, this approach is not systematic and can only reduce power loss. Jeon et al [10] presented a simulated annealing algorithm for network reconfiguration; this algorithm was easy to code but required considerable computation time in large-scale systems. Venkatesh and Ranjan [11] proposed an approach that used an evolutionary programming with fuzzy adaptation as a solution technique; however, as a system grew larger, this method became increasingly complex.…”
Section: Introductionmentioning
confidence: 99%
“…Over the recent years, reconfiguration has been addressed through stochastic, that is, metaheuristic methods, such are the methods based on simulated annealing algorithms [7], fuzzy logics [5], tabu search [12], ant colony [11], and genetic algorithms [1][2][3][4].…”
Section: Introductionmentioning
confidence: 99%
“…Simulated annealing methods are developed to solve the network reconfiguration problem in [10] and [11]. Genetic algorithm considering multiobjective [12], a fuzzy mutated genetic algorithm [13] and refined genetic algorithm [14] for optimal network configuration are published in the literature.…”
Section: Introductionmentioning
confidence: 99%