1994
DOI: 10.1109/61.329526
|View full text |Cite
|
Sign up to set email alerts
|

A new network reconfiguration technique for service restoration in distribution networks

Abstract: Whenever a fault occurs in a particular section of a distribution network and on isolation of the fault some of the loads get disconnected and are left unsupplied. Service should be restored to these affected load points as quickly as possible through a network reconfiguration procedure. A new and efficient technique is presented in this paper for this purpose. Network reduction and determination of the interested trees of the reduced network by a specially developed algorithm for finding the required restorat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0
1

Year Published

2004
2004
2024
2024

Publication Types

Select...
4
3
3

Relationship

1
9

Authors

Journals

citations
Cited by 54 publications
(19 citation statements)
references
References 13 publications
0
18
0
1
Order By: Relevance
“…A similar tree search procedure based on the fundamental loop concept was proposed in [24] to form the structure of MGs. The author in [25] proposed an "interested tree" concept. An "interested tree" is a tree in which all loads are supplied by substations.…”
Section: ) Graph Theorymentioning
confidence: 99%
“…A similar tree search procedure based on the fundamental loop concept was proposed in [24] to form the structure of MGs. The author in [25] proposed an "interested tree" concept. An "interested tree" is a tree in which all loads are supplied by substations.…”
Section: ) Graph Theorymentioning
confidence: 99%
“…the affected group which includes the loads in downstream of the faulty section and the healthy group in the upstream of the faulty section which includes the source). All tie switches connecting the out-of-service group(s) with the other groups are the candidate switches for restoration [11,12,19]. (2) For each out-of-service group, the candidate tie switch with the highest branch current value which is obtained from meshed network (i.e.…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…Urban distribution systems are usually large in scale and are equipped with numerous sectionalizing switches. In the literature many authors have used several techniques to solve this problem: Exhaustive Research ( [6]), Expert Systems ( [7], [8], [9]), Heuristic Research ( [10], [5]), Fuzzy ( [11], [12]), Neural Networks ( [13]) and Genetic Algorithm ( [14], [15]). All these solutions take a long time to be solved and do not provide a feasible switching operation sequence.…”
Section: Introductionmentioning
confidence: 99%