2011
DOI: 10.1016/j.egypro.2011.10.037
|View full text |Cite
|
Sign up to set email alerts
|

Distribution Network Reconfiguration Based on Simulated Annealing Immune Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 1 publication
0
6
0
Order By: Relevance
“…A simulated annealing (SA) immune algorithm is used for optimization of distributed generation reconfiguration in [303], [304] for efficient use of distribution system. An advanced immune algorithm is used in [236] to optimize the clustering performance of TT-SVM pattern classifier.…”
Section: Bee Colony Optimizationmentioning
confidence: 99%
“…A simulated annealing (SA) immune algorithm is used for optimization of distributed generation reconfiguration in [303], [304] for efficient use of distribution system. An advanced immune algorithm is used in [236] to optimize the clustering performance of TT-SVM pattern classifier.…”
Section: Bee Colony Optimizationmentioning
confidence: 99%
“…From every pair of parents two new offspring are created, which need to keep the part of the parent's genetic material, preferably the best one. In most of the approaches that employ evolution algorithms for the network reconfiguration problem, this is usually the point at which the problems appear [5,8,10,11,16,17,19,20,22]. These problems are related to the methods used in the crossover process, which result in offspring that violate radiality constraint or have isolated parts of the network.…”
Section: Crossover Processmentioning
confidence: 99%
“…The proposed algorithm introduces several improvements related to the generation of the initial set of possible solutions as well as crossover and mutation steps in the genetic algorithm. Although genetic algorithms are often used in the optimal reconfiguration of a distribution networks [15][16][17][18][19][20][21][22][23][24], most of the approaches [16][17][18][19][20][21][22][23] don't provide an effective means of creating an initial population, as well as effective operators to implement a crossover and mutation process over the set of population individuals. Due to this, during the evolution process, a large number of generated individuals is often rejected and power flow calculations are often conducted for unfeasible individuals (network topologies), that don't provide the radial network topology or include the isolated parts of the network.…”
Section: Introductionmentioning
confidence: 99%
“…A hybrid Simulated Annealing Immune (SAI) algorithm was presented in [95]. Chen et al considered a loopencoding method to avoid unfeasible solutions for the radial reconfiguration problem.…”
Section: Immune Algorithms (Ia)mentioning
confidence: 99%
“…Chen et al mixed concepts from SA and Immune (SAI) algorithms to avoid local stagnation in [95]. The objective function was to reduce power losses in distribution systems.…”
Section: Simulated Annealing (Sa)mentioning
confidence: 99%