2017 IEEE Manchester PowerTech 2017
DOI: 10.1109/ptc.2017.7980932
|View full text |Cite
|
Sign up to set email alerts
|

Optimal radial distribution network reconfiguration based on multi objective differential evolution algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…The research effort in [12], shows that the genetic algorithm is providing optimal results for sizing the distributed generation. Among them, particle swarm optimization (PSO) and differential evolution algorithm (DEA) are becoming more favorable due to simple modeling, fast calculation, and higher robustness than other algorithms [13,14]. Even though PSO and DEA have advantages, they also have a handicap in terms of convergence in local optimal too quickly in PSO and some DEA mutation problems [15,16].…”
Section: Corresponding Authormentioning
confidence: 99%
“…The research effort in [12], shows that the genetic algorithm is providing optimal results for sizing the distributed generation. Among them, particle swarm optimization (PSO) and differential evolution algorithm (DEA) are becoming more favorable due to simple modeling, fast calculation, and higher robustness than other algorithms [13,14]. Even though PSO and DEA have advantages, they also have a handicap in terms of convergence in local optimal too quickly in PSO and some DEA mutation problems [15,16].…”
Section: Corresponding Authormentioning
confidence: 99%
“…Those types are firefly algorithm, ant colony optimization, harmony search algorithm, particle swarm optimization and differential evolution [7]. Among them particle swarm (PSO) and differential evolution (DE) are becoming more popular due to a simple concept, easy implementation, fast calculation, efficient memory utilization than other algorithms [8,9].…”
Section: Introductionmentioning
confidence: 99%