2013
DOI: 10.1007/978-3-319-03756-1_57
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Placement of DG in Distribution System Using Genetic Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(12 citation statements)
references
References 14 publications
0
12
0
Order By: Relevance
“…The output power of PV module, operating at maximum power point at solar irradiance s, may be estimated using Equation (16).…”
Section: Practical Sizing Of Pv Dgmentioning
confidence: 99%
See 1 more Smart Citation
“…The output power of PV module, operating at maximum power point at solar irradiance s, may be estimated using Equation (16).…”
Section: Practical Sizing Of Pv Dgmentioning
confidence: 99%
“…Ayodele et al [15] used GA to find the best DG technology for optimal power system functioning, as well as the best position and size of the DG to reduce network power loss. GA is applied to reduce the cost of system expansion and improves system stability [16,17]. However, GA convergence time is high, especially, when applied in the solution of complex problems, and may suggest inaccurate solutions.…”
Section: Introductionmentioning
confidence: 99%
“…The results show that, compared to the proposed method, the genetic algorithm finds the optimal problem at lower speeds. In [13], the locating of dispersed generation in distribution networks is provided by considering the voltage stability criteria. In this study, the genetic algorithm is used to find the best answer.…”
Section: Introductionmentioning
confidence: 99%
“…In references [7,11] and [12] have formulated MINLP models to locate and dimension DG and their solutions have been obtained using GAMS, the main advantage of these implementations is that the authors have concentrated their efforts to obtain accurate optimization models for representing the optimization problem; however, the GAMS package has a high probability of reporting local solutions due to the non-convex nature of the exact MINLP model. Regarding the combinatorial optimization, i.e., metaheuristics, in literature can be found multiple approaches to solve the optimal location and sizing DG, some of them are: krill-herd optimization algorithm [1,13]; genetic algorithms [14,15,16,17]; particle swarm optimization [3,18,19]; sunflower optimization algorithm [20]; population-based incremental learning [8]; tabu search algorithm [21,22]; and flower pollination algorithm [23,24], among others.…”
Section: Introductionmentioning
confidence: 99%