1995
DOI: 10.1109/59.466509
|View full text |Cite
|
Sign up to set email alerts
|

Improved method for loss minimization in distribution networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
40
0
1

Year Published

2004
2004
2017
2017

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 66 publications
(41 citation statements)
references
References 7 publications
0
40
0
1
Order By: Relevance
“…The branches are ordered in layers away from the root node [7], as shown in Figure 2. The numbering of the branches in one layer starts only after all of the branches in the previous layer have been numbered.…”
Section: Network Branch Orderingmentioning
confidence: 99%
See 2 more Smart Citations
“…The branches are ordered in layers away from the root node [7], as shown in Figure 2. The numbering of the branches in one layer starts only after all of the branches in the previous layer have been numbered.…”
Section: Network Branch Orderingmentioning
confidence: 99%
“…Existent loops in a weakly meshed network are being opened during the ordering by the 'selection of breakpoints' procedure [7], converting it into an equivalent radial network.…”
Section: Configuration Pre-screeningmentioning
confidence: 99%
See 1 more Smart Citation
“…Perhaps, Castro et al [7] proposed the first ever network reconfiguration algorithm using a switch table to represent the system configuration. In References [8,9], few improved reconfiguration algorithms have been presented. However, these algorithms are not very much general enough to be used in other applications.…”
Section: Introductionmentioning
confidence: 99%
“…Reconfiguração de redes aéreas de distribuição de energia elétrica é um problema de programação não linear inteiro misto (PNLIM) de natureza combinatória, que gera espaços de busca muito grandes, em que a exigência de radialidade é uma dificuldade adicional. Para resolução deste PNLIM são propostos algoritmos de otimização clássica, combinatórios, heurísticos e algoritmos que procuram explorar as vantagens da utilização conjunta de algoritmos heurísticos e combinatórios (Young et al 2002, Cinvalar et al 1988, Morelato et al 1989, Borozan et al 1995, Shirmohammadi et al 1989, Mantovani et al 2000, Peponis et al 1995, Kagan et al 1998e Zhou et al 1997.…”
Section: Introductionunclassified