2004
DOI: 10.1016/j.epsr.2003.10.005
|View full text |Cite
|
Sign up to set email alerts
|

Formulation of distribution reconfiguration problem using network topology: a generalized approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
16
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 38 publications
(16 citation statements)
references
References 8 publications
0
16
0
Order By: Relevance
“…Once the tree building has been performed, a renumbering of nodes and branches can be performed. In fact, the topological analysis of a radial DN can be studied in an efficient way if the following numbering convention is used: root node is added to the node list , and branch list is empty; branches belonging to the tree and connected to the nodes added to the node list in the previous step are inserted into the branch list and numbered with increasing order; in this way, new nodes are added as the end point of new branches; each node belonging to the set of newly added branches gets the same number of the branch reaching it and is added in the node list ; procedure is restarted from step 2 until all nodes in the network have been added. …”
Section: Distribution Network Operationsmentioning
confidence: 99%
See 2 more Smart Citations
“…Once the tree building has been performed, a renumbering of nodes and branches can be performed. In fact, the topological analysis of a radial DN can be studied in an efficient way if the following numbering convention is used: root node is added to the node list , and branch list is empty; branches belonging to the tree and connected to the nodes added to the node list in the previous step are inserted into the branch list and numbered with increasing order; in this way, new nodes are added as the end point of new branches; each node belonging to the set of newly added branches gets the same number of the branch reaching it and is added in the node list ; procedure is restarted from step 2 until all nodes in the network have been added. …”
Section: Distribution Network Operationsmentioning
confidence: 99%
“…Since the number of closed lines in the radial solution is N , closing a tie‐branch creates a loop or a closed path along the branches. The numbering convention adopted allows to find easily the loops formed by the closure of each single tie‐branch . In fact, by defining the following matrices, A incidence matrix of the radial network ( N × N ), u unit matrix ( N t × N t ), k tie‐branch incidence matrix ( N t × N ), …”
Section: Distribution Network Operationsmentioning
confidence: 99%
See 1 more Smart Citation
“…The characteristic of each load is different as the loads are a mixture of domestic, commercial and industrial loads and their concerned peak values do not coincide. This is because the some parts of the network are heavily loaded at certain time periods and lightly loaded at other time periods [5]. Therefore, the loads can be rescheduled by shifting them in such a way that the radial structure of the network can be altered efficiently to minimize the load unbalancing [6].…”
Section: Introductionmentioning
confidence: 99%
“…Due to this reason, DSOs have the need to monitor the state of the network and to find its best arrangement in order to keep its efficiency at high level [1]. Notwithstanding these new requirements, the operation of DN must comply to the radial topology in order to guarantee a reliable and safe operation of the network under fault conditions [2], [3].…”
mentioning
confidence: 99%