2013
DOI: 10.1109/tpwrs.2012.2211626
|View full text |Cite
|
Sign up to set email alerts
|

Optimal distribution network reinforcement considering load growth, line loss, and reliability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
57
0
2

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 110 publications
(59 citation statements)
references
References 33 publications
0
57
0
2
Order By: Relevance
“…Furthermore, the efficiency of the PSObased algorithm is 19% better compared to classical linear programming, as investigated in [48]. Moreover, the evaluation of the employed MPSO in this paper against three well-known heuristic methods, called original PSO, GA, and SA for distribution planning shows the better accuracy and robustness of proposed MPSO [49]. In order to improve the accuracy of the solution, a modified version of PSO (MPSO) is proposed by adding the idea of mutation from the genetic algorithm (GA) as in [45], [50] into standard PSO particle update rules.…”
Section: B Modified Particle Swarm Optimization (Mpso)mentioning
confidence: 78%
See 4 more Smart Citations
“…Furthermore, the efficiency of the PSObased algorithm is 19% better compared to classical linear programming, as investigated in [48]. Moreover, the evaluation of the employed MPSO in this paper against three well-known heuristic methods, called original PSO, GA, and SA for distribution planning shows the better accuracy and robustness of proposed MPSO [49]. In order to improve the accuracy of the solution, a modified version of PSO (MPSO) is proposed by adding the idea of mutation from the genetic algorithm (GA) as in [45], [50] into standard PSO particle update rules.…”
Section: B Modified Particle Swarm Optimization (Mpso)mentioning
confidence: 78%
“…Different approaches have been used in the literature to handle these complexities. Heuristics approaches such as tabu search [3], particle swarm optimization (PSO) [4][5][6][7][8], and genetic algorithm (GA) [9][10][11] have been used to handle large problem sizes. While, decomposition techniques such as forward filling [12], backward pull-out [13], and recursive forward-backward approach [4], [5], [11], [14] have been used for handling time dynamics of MSDEP problems.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations