A new comprehensive genetic algorithm method for optimal overcurrent relays coordination

Razavi, Farzad; Abyaneh, Hossein Askarian; Dabbagh, Hossein A.; Mohammadi, Reza; Torkaman, Hossein

doi:10.1016/j.epsr.2007.05.013

Cited by 266 publications

(207 citation statements)

References 3 publications

Supporting

Mentioning

206

Contrasting

Unclassified

Order By: Relevance

“…The first object function equation to calculate the cost of inductive fault current limiter is given as follows [34]. This equation is used to calculate the minimum FCL impedance.…”

Section: Problem Definitionmentioning

confidence: 99%

New Hybrid Non-Dominated Sorting Differential Evolutionary Algorithm

Bakhshipour¹,

Namdari²,

Bahador³

2016

Bulletin EEI

View full text Add to dashboard Cite

show abstract

“…The first object function equation to calculate the cost of inductive fault current limiter is given as follows [34]. This equation is used to calculate the minimum FCL impedance.…”

Section: Problem Definitionmentioning

confidence: 99%

New Hybrid Non-Dominated Sorting Differential Evolutionary Algorithm

Bakhshipour¹,

Namdari²,

Bahador³

2016

Bulletin EEI

View full text Add to dashboard Cite

show abstract

“…In [8], a modified particle swarm optimization method is proposed to formulate DOCRs coordination problem as a mixed integer nonlinear problem to get optimal relays settings taking into consideration the discrete values for the pickup current settings. A method based on GA was developed to solve mis-coordination problem using continuous or discrete time setting multipliers [9]. Furthermore, some other hybrid techniques have been proposed to reach optimal solution of DOCRs coordination and overcome the drawback of low convergence speed of evolutionary algorithms; however, these algorithms such as hybrid BBO with linear programming (BBO-LP) are more complex for implementation [10].…”

Section: Introductionmentioning

confidence: 99%

“…In the linear model, the time dial settings are only optimized while the pickup current settings values are fixed [7]. Many efforts have been exerted to solve the relays coordination problem and get optimum solutions by applying different recent evolutionary algorithms (EAs) such as: Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Biogeography-Based Optimization (BBO) as introduced in [8][9][10]. In [8], a modified particle swarm optimization method is proposed to formulate DOCRs coordination problem as a mixed integer nonlinear problem to get optimal relays settings taking into consideration the discrete values for the pickup current settings.…”

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

“…Different solutions have been studied to address this complex issue such as simplex method [2,3], graphical selection procedure [4], and application of several optimization algorithms which among them, particle swarm optimization (PSO) [5][6][7][8][9], bee colony algorithm (BCA) [10], genetic algorithm (GA) [11,12], differential evolution (DE) method [13], ant colony optimization (ACO) [14] and etc., have been presented. Although these methods have been investigated for relay coordination issue, in a medium and large scale power system the application of such methods are quite time consuming [15] and in some cases completely difficult and due to this reason meta-heuristic algorithms are not able to sufficiently and quickly process the coordination in practice.…”

Section: Introductionmentioning

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

-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

A new comprehensive genetic algorithm method for optimal overcurrent relays coordination

Cited by 266 publications

References 3 publications

New Hybrid Non-Dominated Sorting Differential Evolutionary Algorithm

New Hybrid Non-Dominated Sorting Differential Evolutionary Algorithm

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

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

Contact Info

Product

Resources

About