2008
DOI: 10.1049/iet-gtd:20070174
|View full text |Cite
|
Sign up to set email alerts
|

Power distribution network expansion scheduling using dynamic programming genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 37 publications
(16 citation statements)
references
References 15 publications
0
16
0
Order By: Relevance
“…So GA (genetic algorithm) [25][26] is used to obtain the best tap positions suitable for the uncertain circumstance at each time segment. The binary code is shown in Fig.…”
Section: Pdipm and Gamentioning
confidence: 99%
“…So GA (genetic algorithm) [25][26] is used to obtain the best tap positions suitable for the uncertain circumstance at each time segment. The binary code is shown in Fig.…”
Section: Pdipm and Gamentioning
confidence: 99%
“…Thus the following process realizations will be analyzed in period 1: (3,4,8), (3,5,7), (3,5,8), (3,5,9), (3,6,7), (3,6,8), (3,6,9). Next, probability distributions for each criterion and each state y 1 ∈ Y 1 are generated.…”
Section: Numerical Examplementioning
confidence: 99%
“…Unfortunately, due to the well known "curse of dimensionality", the possibility of applying this approach in practice doesn't occur very often. Some attempts to overcome the curse of dimensionality are worth noting; they are based on artificial intelligence-for instance ant colonies [25] or genetic algorithms approaches [6].…”
Section: Introductionmentioning
confidence: 99%
“…Otherwise, there will be a risk of low voltage or even voltage collapse [16]. The traditional control and management mode of power distribution network are passive [17]. Its scheduling method is outdated and automation level is low [18].…”
Section: Introductionmentioning
confidence: 99%