Improved group search optimization algorithm for coordination of directional overcurrent relays

Alipour, Manijeh; Teimourzadeh, Saeed; Seyedi, Heresh

doi:10.1016/j.swevo.2015.03.003

Cited by 63 publications

(50 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

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

“…The selected DGs are synchronous type with a rating of 5 MVA, operating nominally at 0.9 lagging power factor [31,32]. The ratio of current transformer of relays (1,2,3,5,7,8,9,10), (11,12,15,16) and (4,6,13,14) is assumed as 120:1, 80:1 and 40:1 respectively. The 3-Φ short circuit results for near-end and far-end faults are presented in Table I.…”

Section: A Test System 1: Ieee 14-bus Networkmentioning

confidence: 99%

“…4 that has been employed for this task. This network is supplied from three primary distribution transformers connected at buses B 1 , B 6 and B 13 . The system has a total of 38 DOCRs installed at each end of the lines.…”

Section: B Test System 2: Ieee 30-bus Networkmentioning

confidence: 99%

A Novel Approach for Optimum Coordination of Directional Overcurrent Relays Including Far-End Faults in Interconnected Power Systems

Rajput¹,

Pandya²

2016

IJET

View full text Add to dashboard Cite

Abstract- I. INTRODUCTIONThe primary protection in distribution and sub-transmission networks and backup protection in transmission networks are usually provided using DOCRs [1]. For reducing the chances of excessive power outages, only faulted section of the power system is isolated using primary relays as quickly as possible. As long as the primary relay fails to operate, the backup relays have to instigate to clear the fault after the prescribed time interval. This practice is called relay coordination. The proper coordination of primary and backup relays is essential to ensure the reliability of protection scheme, which is achieved by locating the optimal values of PS and TMS. In modern multi-loop and multi-source interconnected power systems, finding the optimal PS and TMS using analytical methods becomes very hard. Alternatively, it can be easily solved by optimization techniques [2].In the last few years, several optimization techniques are employed to solve the relay coordination problem. Among the conventional methods, Linear Programming (LP) technique gained good recognition to solve this problem, including simplex, two-phase simplex and dual simplex methods [3][4][5]. The LP methods involve assumptions in PS, allowing for operating time of each relay as a linear function of TMS. In [6,7], Sequential Quadratic Programming (SQP) has been used in order to optimize both TMS and PS. Afterwards, Artificial Intelligence (AI) techniques are studied more to solve the coordination problem such as GA The HSA is one of the metaheuristic optimization methods which is developed by Z.W. Geem [22]. It has the characteristics of fast convergence speed, easy in concept and simple in implementation with only a few parameters and mathematical requirements [22,23]. Same as other metaheuristic methods, the performance of the HSA experiences a serious problem of sensitive parameters setting. Hence, fine tuning of the parameters are required, which can help the HSA to maintain a balance between diversification and intensification and to explore the population in the evolution process [24]. To improve the performance of HSA, IHSA is presented in

show abstract

“…The coordination problem is solved using different metaheuristic method is [25]. Reference [26] suggests that the coordination of the overcurrent relay is formulated as a nonlinear program by employing a group search optimization algorithm. In the paper by [27], the hybridized symbiotic organism search method is used to deal with the directional overcurrent relay problem.…”

Section: Introductionmentioning

confidence: 99%

Application of a Continuous Particle Swarm Optimization (CPSO) for the Optimal Coordination of Overcurrent Relays Considering a Penalty Method

et al. 2018

View full text Add to dashboard Cite

Abstract:In an electrical power system, the coordination of the overcurrent relays plays an important role in protecting the electrical system by providing primary as well as backup protection. To reduce power outages, the coordination between these relays should be kept at the optimum value to minimize the total operating time and ensure that the least damage occurs under fault conditions. It is also imperative to ensure that the relay setting does not create an unintentional operation and consecutive sympathy trips. In a power system protection coordination problem, the objective function to be optimized is the sum of the total operating time of all main relays. In this paper, the coordination of overcurrent relays in a ring fed distribution system is formulated as an optimization problem. Coordination is performed using proposed continuous particle swarm optimization. In order to enhance and improve the quality of this solution a local search algorithm (LSA) is implanted into the original particle swarm algorithm (PSO) and, in addition to the constraints, these are amalgamated into the fitness function via the penalty method. The results achieved from the continuous particle swarm optimization algorithm (CPSO) are compared with other evolutionary optimization algorithms (EA) and this comparison showed that the proposed scheme is competent in dealing with the relevant problems. From further analyzing the obtained results, it was found that the continuous particle swarm approach provides the most globally optimum solution.

show abstract

Improved group search optimization algorithm for coordination of directional overcurrent relays

Cited by 63 publications

References 30 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

A Novel Approach for Optimum Coordination of Directional Overcurrent Relays Including Far-End Faults in Interconnected Power Systems

Application of a Continuous Particle Swarm Optimization (CPSO) for the Optimal Coordination of Overcurrent Relays Considering a Penalty Method

Contact Info

Product

Resources

About