1991
DOI: 10.1109/mper.1991.88842
|View full text |Cite
|
Sign up to set email alerts
|

Coordination of directional relays without generating all circuits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
13
0

Year Published

2005
2005
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 4 publications
1
13
0
Order By: Relevance
“…Extensive research on the topic of automatic calculation of protection settings has been undertaken [8], which includes the use of topological analysis [9][10][11], optimisation theory [12,13] and artificial intelligence [8,14,15]. However, such systems performing automatic protection setting and coordination are not particularly suitable for settings validation, even though they provide very relevant functionality.…”
Section: Validation Of Protection Settingsmentioning
confidence: 99%
“…Extensive research on the topic of automatic calculation of protection settings has been undertaken [8], which includes the use of topological analysis [9][10][11], optimisation theory [12,13] and artificial intelligence [8,14,15]. However, such systems performing automatic protection setting and coordination are not particularly suitable for settings validation, even though they provide very relevant functionality.…”
Section: Validation Of Protection Settingsmentioning
confidence: 99%
“…For large scale penetration of DER, the reach setting of distance relays installed at transmission line may get effected [8]. iv) From the literature, it is also observed that, the relay coordination problems are optimised without any upper limit of CTI [21,43]. This results in delayed operation of backup over current relays particularly when the fault current contribution from Photovoltaic based DER is weak.…”
Section: Review Of Methodologies Used For Formulation Of Fitness Funcmentioning
confidence: 99%
“…This technique is quite simple, fast and requires only half number of network the loops. Therefore, the need of generating all loops were eliminated in this technique [21] and only fundamental circuit matrix is sufficient to generate all the B/P as well as BPS. A method based on the branches of the network was also reported in [22] for determining the minimum BPS.…”
Section: Graph Theory Techniquesmentioning
confidence: 99%
“…Essentially, this approach is an extension of the graph theoretic approach developed by Dwarakanath and Nowitz [5]. The approach presented in [1] suffered from certain inefficiencies which have been addressed in [6], [7], [8]. Bapeswara Rao et.…”
Section: Introductionmentioning
confidence: 99%
“…Reference [7] has suggested further enhancements using Breadth First Search (BFS) algorithm. A method that does not require computation of all loops is presented in [8]. It is shown that all the minimal break point set of the given graph is a product term in boolean function S expressed over only fundamental set of loops.…”
mentioning
confidence: 99%