An Optimized Protection Coordination Scheme for the Optimal Coordination of Overcurrent Relays Using a Nature-Inspired Root Tree Algorithm

Wadood, Abdul; Farkoush, Saeid Gholami; Khurshaid, Tahir; Kim, Chang-Hwan; Yu, Jiaqi; Geem, Zong Woo; Rhee, Sang-Bong

doi:10.3390/app8091664

Cited by 60 publications

(44 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The execution of WCA is implemented on three different network configurations and it was observed that the proposed WCA gives a better solution in all the contextual analysis. The detailed system descriptions of all three cases can be found in [2,26,29]. The purpose behind considering a single loop and multi-loop network is that depending upon different networks, the number of constraints, CTI and complexity varies.…”

Section: Resultsmentioning

confidence: 99%

“…It reduces minimum operating time by 11.50 s and 0.97 s in comparison with the simplex method and root tree algorithm, respectively. It is found that WCA provides slightly improved net time gain relative to RTA, but as oppose to RTA, WCA takes fewer iterations [29]. The WCA gave less operating time and improved the performance of seven OC relay with optimized TDS.…”

Section: Comparison Of Wca With Simplex Methods and Root Tree Algorithmmentioning

confidence: 92%

“…Optimization techniques recently in use for solving the relay coordination problem include firefly algorithm (FA) [1], chaotic firefly algorithm (CFA) [26], harmony search algorithm (HAS) [27], symbiotic organism search (SOS) [28], root tree algorithm (RTA) [29], grey wolf optimization (GWO) [30] and most valuable player algorithm (MVPA) [31]. However, the drawback with most of these heuristic approaches in computing an optimal relay setting is that there is always a risk of convergence to local minima, requires a large population, have a slow rate of convergence and takes more computational time.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Online implementation of time augmentation of over current relay coordination using water cycle algorithm

Kudkelwar

Sarkar

2019

SN Appl. Sci.

View full text Add to dashboard Cite

In the present paper, a technique is presented for new investigations for the constrained type optimal coordination of over current relay problem using the water cycle algorithm (WCA). It is shown that the operating time of relay mainly depends upon the time dial setting (TDS) and plug settings. The paper introduces a novel metaheuristic optimizer algorithm, WCA, encouraged by the water sequence process and movements of rivers and flows on the way to the sea. Results are presented for the application of the methodology on a distribution system of single-end one loop system, Single-end multi-loop system and single-end multi-parallel feeder distribution system. Subsequently, the results find the minimal operating time of relay with optimized TDS for over current relay. The result reveals the effectiveness and superiority of the proposed WCA over the other techniques presented in the literature in terms of accuracy, input parameter and iterations.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Comparison Of Wca With Simplex Methods and Root Tree Algorithmmentioning

confidence: 92%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Online implementation of time augmentation of over current relay coordination using water cycle algorithm

Kudkelwar

Sarkar

2019

SN Appl. Sci.

View full text Add to dashboard Cite

show abstract

“…Some studies have addressed the protection coordination in a loop distribution system. In [13], an optimal protection coordination method for the overcurrent relay in a loop power distribution system was proposed using the nature-inspired root tree algorithm. In [14], an optimization method for the time-dial setting of the directional overcurrent relay in the closed-loop power distribution system was proposed.…”

Section: Introductionmentioning

confidence: 99%

“…Herein, we address the protection issue considering the operation of the tie switch in the open-loop system. In [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16], protection issues in a closed-loop system were addressed; however, the operation of the tie switch was not considered except in [1]. To solve the problem in [1], we propose a new protection scheme based on the coordination with a tie switch.…”

Section: Introductionmentioning

confidence: 99%

New Protection Scheme Based on Coordination with Tie Switch in an Open-Loop Microgrid

Seo¹

2019

Energies

View full text Add to dashboard Cite

Owing to the increase in renewable energy, microgrids (MGs) are increasing. A MG has a small loop-type grid configuration. In the loop MG, challenges in protection such as maloperation of protection relay may occur owing to bidirectional current flow. Herein, we propose a new protection scheme in the loop MG. Considerations for protection in loop MG and fault characteristics are analyzed. Based on these, a new index to solve the considerations for MG protection are proposed using a wavelet transform. Furthermore, the new protection scheme based on the coordination with tie switch using the proposed new index is proposed. To verify the proposed scheme, the MG and the proposed scheme are modeled using the electromagnetic transients program and MATLAB. Various simulations according to the fault location and the success/failure of fault section separation are performed. Simulation results indicate that the power supply on the original feeder can be maintained by proposed method.

show abstract

An over current relay coordination: A comparative analysis of metaheuristic and linear program approach

Sarkar

Kudkelwar

2021

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

A number of recent or novel metaheuristic algorithms have been explored in the subject of optimization; although now not all of these algorithms are as efficient as their creators claim, a few have been confirmed to be a pretty efficient and useful tool for addressing complex optimization problems. On the other aspect, LINGO is a software tool used for linear, nonlinear, optimization problems. This paper's objective is to study how well the LINGO optimizer performs as contrasted to metaheuristic optimization strategies for over current relay coordination. The operation of directional over current relay is demonstrated with the applicability of LINGO optimizer and metaheuristic strategies. In this study, two distinct case studies, which include a mixed overhead line‐underground cable and a DER primarily based IEC microgrid benchmark, are tested for comparative evaluation among the LINGO optimizer and metaheuristic strategies. During the first stage of case study I, the crow search algorithm (CSA), a novel metaheuristic technique, was proposed, and its results are contrasted with the most popular conventional techniques: Particle swarm optimization (PSO) and water cycle algorithm (WCA). It reveals that implementing the proposed CSA algorithms improved over all time setting concerning the most common traditional techniques such as PSO and WCA. And, after implementing the LINGO optimizer, it is proven that compared with other metaheuristic optimization techniques, the second one proposed LINGO optimizer provides advanced consequences. In a similar manner, both proposed methods were applied and determined their performances in case study II and once more LINGO proved its strength over the metaheuristic approach.

show abstract

An Optimized Protection Coordination Scheme for the Optimal Coordination of Overcurrent Relays Using a Nature-Inspired Root Tree Algorithm

Cited by 60 publications

References 35 publications

Online implementation of time augmentation of over current relay coordination using water cycle algorithm

Online implementation of time augmentation of over current relay coordination using water cycle algorithm

New Protection Scheme Based on Coordination with Tie Switch in an Open-Loop Microgrid

An over current relay coordination: A comparative analysis of metaheuristic and linear program approach

Contact Info

Product

Resources

About