2013
DOI: 10.1049/iet-gtd.2012.0721
|View full text |Cite
|
Sign up to set email alerts
|

An analytic approach for optimal coordination of overcurrent relays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
53
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 90 publications
(53 citation statements)
references
References 20 publications
0
53
0
Order By: Relevance
“…(20)(21)(22), and are equal to 2, and w is a factor of and with values 0.4 and 0.9 respectively, and depict the present position and velocity of particle in a D-dimensional search space. The case study in Fig.…”
Section: Analytical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…(20)(21)(22), and are equal to 2, and w is a factor of and with values 0.4 and 0.9 respectively, and depict the present position and velocity of particle in a D-dimensional search space. The case study in Fig.…”
Section: Analytical Resultsmentioning
confidence: 99%
“…The minimum and maximum operating time of each relay is set to 0.1s and 4s. Here, as for microprocessor based relays, the continuous form of TMS and PS are considered as relay settings [5,[20][21][22][23]30].…”
Section: Analytical Resultsmentioning
confidence: 99%
“…An approach based on the "interior point primal-dual algorithm" was discussed in [27] where additional constraints were imposed by distance relays and breaker failure on relay coordination studies. Gradient search based technique was also applied successfully for optimization of relay coordination problems for mid line faults [28].…”
Section: Analytic Methodsmentioning
confidence: 99%
“…In [69,70], adaptive optimal methodology based on a modified PSO technique were applied for selection of over current relay settings during on line mode according as per the prevailing network topology. The pre-solution and filtering simplification techniques were used prior to the application of linear programming algorithm for reducing the size and complexity of system [27]. The interior point based approach reaches close to the vicinity of the final optimal result hardly in only one or two iteration.…”
Section: Adaptive Relaying Based Methodsmentioning
confidence: 99%
“…As far as analytic techniques are concerned, several iterative numerical algorithms have been proposed [8]- [13]. In these approaches, the coordination constraints form a system of inequalities, and acceptable values of time dial and pickup current settings are calculated in each iteration.…”
Section: A Literature Reviewmentioning
confidence: 99%