2008 International Conference on Control, Automation and Systems 2008
DOI: 10.1109/iccas.2008.4694499
|View full text |Cite
|
Sign up to set email alerts
|

Optimal multi-distributed generation placement by adaptive weight particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(26 citation statements)
references
References 3 publications
0
25
0
Order By: Relevance
“…Most of them find the optimal allocation and size of single DG in order to reduce losses and improve voltage profiles [6,[9][10][11][12][13]. Others include the placement of multiple DGs with artificial intelligence-based optimization methods [7,[14][15][16][17][18] and a few go with analytical approach [11,17].…”
Section: Introductionmentioning
confidence: 99%
“…Most of them find the optimal allocation and size of single DG in order to reduce losses and improve voltage profiles [6,[9][10][11][12][13]. Others include the placement of multiple DGs with artificial intelligence-based optimization methods [7,[14][15][16][17][18] and a few go with analytical approach [11,17].…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, for real power loss minimization the solar photovoltaic (SPV) and wind energy based renewable DGs are considered for integration with capacitor banks in RDN. Based on their real and reactive power generation capacity they are modeled as follows [7]- [9] (Table 1). …”
Section: Introductionmentioning
confidence: 99%
“…If wind turbine is connected to an induction generator, Wind generator supply real power and in turn absorbs reactive power. When a wind generator of size P DG is placed at bus j the absorbing reactive power can be given as [13] : …”
Section: Casementioning
confidence: 99%
“…The particle updates its velocity according to its previous velocity and the distances to its current position from both its own best historical position and the best positions of the neighbors in every iteration step, and then it flies towards a new position given by [12,13] .…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%