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

DG allocation with application of dynamic programming for loss reduction and reliability improvement

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
172
0
7

Year Published

2013
2013
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 315 publications
(179 citation statements)
references
References 13 publications
0
172
0
7
Order By: Relevance
“…This system was also considered in [7,[9][10][11], and it represents a typical case of DG optimization planning. It consists of one 132 kV/33 kV substation (40 MVA capacity) at bus 9 to serve eight aggregated loads (33 kV/11 kV service transformers) at buses 1-8 under normal operation conditions.…”
Section: Case Studymentioning
confidence: 99%
See 1 more Smart Citation
“…This system was also considered in [7,[9][10][11], and it represents a typical case of DG optimization planning. It consists of one 132 kV/33 kV substation (40 MVA capacity) at bus 9 to serve eight aggregated loads (33 kV/11 kV service transformers) at buses 1-8 under normal operation conditions.…”
Section: Case Studymentioning
confidence: 99%
“…The above theses choose losses to serve as object function, and cannot formulate a scientific model to assess the effects of implementing DG in distribution systems. In [7][8][9][10], the theses construct multi-objective mathematical models, but they convert the multi-objective function into the single objective function, a method that not only omits the relationship among objectives, but also results in the absence of a comprehensive optimization perspective to find the global optimal result. In [11,12], though the theses build reasonable multi-objective functions, they lack a systematic optimization method to handle multi-objectives.…”
Section: Introductionmentioning
confidence: 99%
“…Son restringidos a la hora de aplicarlos a problemas reales, debido a la alta complejidad que presentan; sin embargo, son eficientes en problemas sencillos. Para solucionar el problema de GD en el SD, los métodos más utilizados son [34]: programación lineal [40], programación no lineal [41], programación dinámica [42], programación entera [43] y programación estocástica [44].…”
Section: Métodos Numéricosunclassified
“…To overcome this obstacle, different techniques and computational methods for optimal location/installation have been proposed in recent years [10].…”
Section: Introductionmentioning
confidence: 99%