A new genetic algorithm method for optimal coordination of overcurrent relays in a mixed protection scheme with distance relays

Abyaneh, H.A.; Kamangar, Somayeh Sadat Hashemi; Razavi, Farzad; Chabanloo, Reza Mohammadi

doi:10.1109/upec.2008.4651442

Cited by 27 publications

(11 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…23,24,44 (iv) The convergence issues are another concern with conventional optimization methods, especially in large power grids. (ii) The performance of the analytical solutions depends on the initial values of decision variables.…”

Section: Ga For Solving the Defined Optimization Problemmentioning

confidence: 99%

“…(iii) Multisegment TCCs provide discontinuous functions, which are ill-conditioned for analytical methods (gradient-based). 23,24,44 (iv) The convergence issues are another concern with conventional optimization methods, especially in large power grids. 27 Among different artificial intelligence-based methods, the GA has received large attention, 29,31,44 and we utilized it to solve the optimization problem.…”

Section: Ga For Solving the Defined Optimization Problemmentioning

confidence: 99%

See 1 more Smart Citation

Optimal time‐current graded coordination of multistage inverse‐time overcurrent relays in distribution networks

Hamidi

Ahmadian

Patil

et al. 2019

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

Summary This paper proposes a method for optimal coordination of multistage overcurrent relays (OCRs) in radial distribution networks, including industrial, rural, and urban grids. The proposed method optimally coordinates multistage time‐current curves (TCCs) using the genetic algorithm (GA). The proposed method is able to determine the proper TCC type (eg, moderately inverse, very inverse, and extremely inverse), pickup current, and time‐setting multiplier (TSM) for each stage of TCCs. The proposed method utilizes the dynamic models of OCRs and fuses. This safeguards the relays against the maloperations resulting from the DC decaying part of fault currents and transient overcurrents caused by transformer energization or motor starting. The proposed method is evaluated using DIgSILENT Power Factory for power system analysis and Matlab for implementation of the proposed method. According to the simulation outcomes, the advantages and disadvantages of the proposed method are discussed and compared with the existing methods.

show abstract

Section: Ga For Solving the Defined Optimization Problemmentioning

confidence: 99%

Section: Ga For Solving the Defined Optimization Problemmentioning

confidence: 99%

Optimal time‐current graded coordination of multistage inverse‐time overcurrent relays in distribution networks

Hamidi

Ahmadian

Patil

et al. 2019

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

show abstract

“…In Abyaneh et al, genetic algorithm (GA) is proposed to solve DRs and DOCs coordination problem by introducing a novel objective function (OF). In Abyaneh et al, T z 2 and I pi are considered as constant values.…”

Section: Introductionmentioning

confidence: 99%

A new objective function for adaptive distance and directional over-current relays coordination

Moravej

Ardebili

2018

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

Summary The complexity and importance of relay coordination problem are added by increasing interconnection and interpenetration of power networks. Online, adaptive, fast, and reliable re‐coordination of relays are more needed to provide requirements of both clients and the new smart and fast‐changing power network. In this paper, distance and directional over‐current relays coordination problem is solved adaptively by using modified bees algorithm and changing the conventional objective function by using flexible coordination time intervals and pickup currents. The modification on the optimization algorithm has shown up to 50% improvement in efficiency that can be used in other optimization problems. 8, 14, and 30 bus sample networks were simulated to evaluate proposed method. The result of the optimization problem has shown a very good improvement compared with the methods that have been used in prior researches.

show abstract

“…In these papers, overcurrent protection schemes are analyzed mainly. Distance protection cooperating with overcurrent protection is analyzed in papers [5,8,9]. The above papers do not concern cooperation of distance protections.…”

Section: Introductionmentioning

confidence: 99%

“…Linear programming [4,5] and soft-computing approaches [6,9] are used in order to solve the relay coordination problem provided tripping times (coordination intervals) are known. Our goal is to give a method that calculates optimal values of tripping times.…”

Section: Introductionmentioning

confidence: 99%

Selection of minimal tripping times for distance protection using fault trees with time dependencies

Lukowicz¹,

Magott²,

Škrobánek³

2011

Electric Power Systems Research

View full text Add to dashboard Cite

A new genetic algorithm method for optimal coordination of overcurrent relays in a mixed protection scheme with distance relays

Cited by 27 publications

References 6 publications

Optimal time‐current graded coordination of multistage inverse‐time overcurrent relays in distribution networks

Optimal time‐current graded coordination of multistage inverse‐time overcurrent relays in distribution networks

A new objective function for adaptive distance and directional over-current relays coordination

Selection of minimal tripping times for distance protection using fault trees with time dependencies

Contact Info

Product

Resources

About