2003
DOI: 10.1109/tpwrs.2003.811170
|View full text |Cite
|
Sign up to set email alerts
|

Long-term distribution network expansion planning by network reconfiguration and generation of construction plans

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0
2

Year Published

2011
2011
2020
2020

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 62 publications
(13 citation statements)
references
References 6 publications
0
9
0
2
Order By: Relevance
“…The DN expansion has a core function to supply new load nodes with electrical energy, but this also includes the connection of future DG units. Universally, the aim of DN expansion is the minimization of installation and operation costs of new substations, cables and overhead lines [3][4][5]. DN expansion can be enforced by using network analysis software (NEPLAN, ETAP, PowerFactory, etc.)…”
Section: The Planning Of Distribution Network Expansion and Operationmentioning
confidence: 99%
“…The DN expansion has a core function to supply new load nodes with electrical energy, but this also includes the connection of future DG units. Universally, the aim of DN expansion is the minimization of installation and operation costs of new substations, cables and overhead lines [3][4][5]. DN expansion can be enforced by using network analysis software (NEPLAN, ETAP, PowerFactory, etc.)…”
Section: The Planning Of Distribution Network Expansion and Operationmentioning
confidence: 99%
“…Additionally, this approach alters the essence of the original technical problem. On the other hand, some authors have studied this problem using aggregation functions, converting the multi-objective problem into a single objective one that assumes a (weighted or not) sum of the selected objective functions [23][24][25][26][27][28][29][30]. The major difficulty in this kind of problem consists in the incompatibility of different criteria.…”
Section: Introductionmentioning
confidence: 99%
“…In order to avoid the evaluation of the entire space of the candidate solutions and to minimize the computation burden, several algorithms have been developed. Most authors have used different well known heuristics (branch exchange [2,3,21], branch and bound [1,4], simulated annealing [5]), other heuristic rules or meta-heuristics [7][8][9][11][12][13]15,17,22,23,25,27,28] or multi-agent technologies [20]. On the other hand, some authors have developed methods based on evolutionary computation techniques [6,14,16,18,19,24,26,29,30].…”
Section: Introductionmentioning
confidence: 99%
“…Several methods for optimal allocation of SVRs in distribution feeders and plan of distribution system expansion have been proposed [2][3][4][5][6]. However, these papers have not been based on the cooperative control of SVRs and LRT in plural distribution feeders and the forecasted amount of PV introduced to distribution feeders a few years later.…”
Section: Introductionmentioning
confidence: 99%