Coordination of Directional Overcurrent Relays Using Seeker Algorithm

Amraee, Turaj

doi:10.1109/tpwrd.2012.2190107

Cited by 297 publications

(274 citation statements)

References 13 publications

Supporting

Mentioning

265

Contrasting

Unclassified

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

An Innovative Fast Relay Coordination Method to Bypass the Time Consumption of Optimization Algorithms in Relay Protection Coordination

Kheshti¹,

Kang²,

Jiao³

2017

Journal of Electrical Engineering and Technology

View full text Add to dashboard Cite

-Relay coordination in power system is a complex problem and so far, meta-heuristic algorithms and other methods as an alternative approach may not properly deal with large scale relay coordination due to their huge time consuming computation. In some cases the relay coordination could be unachievable. As the urgency for a proper approach is essential, in this paper an innovative and simple relay coordination method is introduced that is able to be applied on optimization algorithms for relay protection coordination. The objective function equation of operating time of relays are divided into two separate functions with less constraints. As the analytical results show here, this equivalent method has a remarkable speed with high accuracy to coordinate directional relays. Two distribution systems including directional overcurrent relays are studied in DigSILENT software and the collected data are examined in MATLAB. The relay settings of this method are compared with particle swarm optimization and genetic algorithm. The analytical results show the correctness of this mathematical and practical approach. This fast coordination method has a proper velocity of convergence with low iteration that can be used in large scale systems in practice and also to provide a feasible solution for protection coordination in smart grids as online or offline protection coordination.

show abstract

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 Innovative Fast Relay Coordination Method to Bypass the Time Consumption of Optimization Algorithms in Relay Protection Coordination

Kheshti¹,

Kang²,

Jiao³

2017

Journal of Electrical Engineering and Technology

View full text Add to dashboard Cite

show abstract

“…I p min I p I p max (4) In Inequality (3), TMS limits are determined through permissible range given by relay manufacturer. In this paper TMS range is assumed to be between 0.05-1.2.…”

Section: B Constraints Of Relay Settingsmentioning

confidence: 99%

“…The problem is fundamentally depends on two DOCRs settings, namely pickup current setting (I p ) and time multiplier setting (TMS). Linear programming or nonlinear programming are the two ways that are used to formulate optimal relay coordination problem [4]. In linear approach I p settings are assumed to be pre-determined and the rest of the problem is solved using linear programming (LP) technique.…”

Section: Introductionmentioning

confidence: 99%

Optimal Overcurrent Relay Coordination Using Hybrid Genetic Algorithm and Linear Programming Method

Kekezoğlu¹,

Can²,

Akdemir³

et al. 2016

Fourth International Conference on Advances in Computing, Electronics and Communication - ACEC 2016

View full text Add to dashboard Cite

Abstract-Power systems are exposed to various faults, such as phase-phase, phase-ground, 3-phase-ground during their operations. Due to fault type and location, some part of the system cannot be supplied when a fault occurs. Moreover, this issue not only reduces power quality parameters but also increases total energy cost of the system. Overcurrent relays are widely used tools for detecting and clearing fault in power systems. In addition to this, relays must be operated in a harmony whilst fault occurs. The coordination among relays can be quarantined by arranging their characteristics through adjusting their parameters. In conventional approach, operation characteristics of relays depend on two variables namely, pick up current (Ip) and time multiplier settings (TMS). In recent decades, several studies about optimization of relay coordination problem have been done. Since relay coordination problem is a non-convex optimization problem, most of studies has been used heuristic optimization techniques such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO). In this paper, relay coordination problem is solved by a hybrid Genetic Algorithm and Linear Programming (GALP) method. Both GA search space and computational effort is reduced using GALP. Hybrid method is tested on IEEE 14-Bus Test System. GALP and GA is programmed in MATLAB while DigSILENT Power Factory program is used to obtain values of power system parameters. Results show that GALP can converge to optimal solution faster than GA and increase in Distributed Generation (DG) capacity causes a rise in the total relay operating time.

show abstract

“…Losing relays coordination results in unwanted false tripping for some healthy feeders. Furthermore, it may cause long time delay for tripping and isolating faulty feeders, resulting in significant fault currents overstresses on power system equipment and reducing their life time [2].…”

Section: Introductionmentioning

confidence: 99%

New Coordination Approach to Minimize the Number of Re-adjusted Relays When Adding DGs in Interconnected Power Systems

Ibrahim¹,

Zahab²,

Mostafa³

2017

Journal of Electrical Engineering and Technology

View full text Add to dashboard Cite

-The presence of DGs in power system networks tends to negatively affect the protective relays coordination. The proposed method introduces an approach to minimize the numbers of relays that acquire new settings on contrary to their original settings (case without DG), to achieve relays coordination in case of adding DG, since relays coordination with minimum number of relays of readjusted settings represents economical target, especially in networks containing mixture of electromechanical and adaptive digital relays. The scheme decides the possible minimum number of re-adjusted relays and their locations in an optimum manner to achieve proper relays coordination in case of adding DGs. The proposed approach is divided into two successive phases; the first phase is stopped when the first relays coordination solution is achieved. The second phase increases the possibility to keep higher number of relays at their original settings than that obtained in first phase through achieving multi solutions of relays coordination. The proposed approach is implemented and effectively tested on the well-known IEEE-39 bus test system.

show abstract

Coordination of Directional Overcurrent Relays Using Seeker Algorithm

Cited by 297 publications

References 13 publications

An Innovative Fast Relay Coordination Method to Bypass the Time Consumption of Optimization Algorithms in Relay Protection Coordination

An Innovative Fast Relay Coordination Method to Bypass the Time Consumption of Optimization Algorithms in Relay Protection Coordination

Optimal Overcurrent Relay Coordination Using Hybrid Genetic Algorithm and Linear Programming Method

New Coordination Approach to Minimize the Number of Re-adjusted Relays When Adding DGs in Interconnected Power Systems

Contact Info

Product

Resources

About