Hybrid GSA‐SQP algorithm for optimal coordination of directional overcurrent relays

Radosavljević, Jordan; Jevtić, Miroljub

doi:10.1049/iet-gtd.2015.1223

Cited by 93 publications

(50 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, it can be concluded that relays nos. 17, 19, 21, and 23 have no backup for such faults . In other words, one can say that relays nos.…”

Section: Simulation Results and Discussionmentioning

confidence: 99%

“…The SFSA is compared with other methods such as hybrid gravitational search algorithm‐sequential quadratic programming (GSA‐SQP) and DE, which are presented in Table . In this comparison, the same conditions and constraints are applied as stated in scenario 2.…”

Section: Simulation Results and Discussionmentioning

confidence: 99%

“…Promising alternative solutions to tackle the difficulties and drawbacks of the conventional methods are the applications of heuristic‐based optimization procedures, with the understanding that the relay coordination plans are formulated as an optimization problem with various complexity and nonlinearity, which can be solved using the application of heuristic‐based algorithms. Among these heuristic‐based computing algorithms are genetic algorithm (GA), ant colony algorithm, various variants of differential evolution (DE) algorithm, firefly algorithm, teaching learning optimization algorithm, artificial bees colony, flower pollination algorithm (FPA), symbiotic organism search optimization, and many more, which have been attempted to solve the relay coordination problems under various network topologies. In the study of Alam et al, 5 meta‐heuristic optimization methods are considered to solve the optimal relay coordination with comprehensive comparisons of their performances.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimized settings of directional overcurrent relays in meshed power networks using stochastic fractal search algorithm

El‐Fergany

Hasanien

2017

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

Summary This paper presents a novel application of the stochastic fractal search algorithm to solve the optimal relay coordination problem of meshed power networks. The optimization problem has 3 design variables, which are the time dial, the pickup current, and the tripping characteristic of each relay and subjects to set of coordination constraints. The objective function is adapted to minimize the total operating time of the primary and backup relays while maintaining the validity of coordination within acceptable limits. Three interconnected power systems with various topologies and fault scenarios are demonstrated. Among these 3 test cases, it is worthy emphasizing that the third power system is highly penetrated with 6 distributed generators, which tangle the optimization problems with numerous relay pair scenarios. The validity and the effectiveness of the proposed method are confirmed using the simulation results, in addition to necessary subsequent comparisons to other competing approaches. The simulated numerical results and the performance measures indicate that the stochastic fractal search algorithm is viable and able to generate competitive optimal settings for overcurrent relays and lie in an acceptable elapsed time.

show abstract

“…Therefore, it can be concluded that relays nos. 17, 19, 21, and 23 have no backup for such faults . In other words, one can say that relays nos.…”

Section: Simulation Results and Discussionmentioning

confidence: 99%

Section: Simulation Results and Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimized settings of directional overcurrent relays in meshed power networks using stochastic fractal search algorithm

El‐Fergany

Hasanien

2017

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

show abstract

“…Security of the PC obligates the existence of enough time difference which is referred to as the coordination time interval (CTI) between operation of the primary relay and its backup. This requirement for different combinations of distance and DOCRs in different critical points is formulated by (13) to (18):…”

Section: Formulating the Proposed Coordination Approachmentioning

confidence: 99%

Coordination of mixed distance and directional overcurrent relays: Miscoordination elimination by utilizing dual characteristics for DOCRs

Yazdaninejadi

Nazarpour

Talavat

2018

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

Summary Keeping selectivity among protective devices in electrical grids is of crucial importance. This task in the combinatorial protection scheme of distance and directional overcurrent relays (DOCRs) stands as a complicated problem, especially in interconnected networks. To overcome this issue, this paper proposes an enhanced protection coordination (PC) scheme by employing dual time‐current characteristics (D‐TCCs) for overcurrent relays which are followed by two inverse‐time curves in series. These characteristics simplify the complexity of the problem and yield higher flexibility and extensibility in PC process which helps to meet selectivity requirements. However, these characteristics can be implemented by numerical DOCRs which poses investment costs. Therefore, a techno‐economic optimal replacement model is devised to attain a least‐cost numerical DOCRs deployment plan while eliminating miscoordination and minimizing total operation time of the relays. Furthermore, inverse‐time curves of DOCRs are selected optimally among available options for conventional relays. By doing so, the attained flexibility is intensified which lessens imparted economic burden through alleviating the replacement level of numerical DOCRs. The proposed approach calls the need for making amendments in coordination points to handle coordination problem in the case where both conventional DOCRs and numerical DOCRs with D‐TCCs are present. Therefore, coupled with the conventional selectivity constraints, the constraint associated with new coordination points are all together accommodated in the optimization process. The proposed model demonstrates a mixed integer nonlinear programming fashion which is solved with sine‐cosine algorithm. Several numerical studies are carried out to interrogate the validity of the proposed approach. The obtained results are encouraging.

show abstract

“…However, and unlike the PSO, it does not pay much attention to the cooperative behavior of all groups. Many other algorithms have also been incorporated in solving the DOC relays coordination problem, such as the Gravitational Search Algorithm [29], Biogeography-based Energies 2019, 12, 4115 3 of 16 optimization [8], Electromagnetic Field Optimization [30], Firefly algorithm [31] and the Whale Optimization Algorithm [32].…”

Section: Introductionmentioning

confidence: 99%

Optimal Coordination of DOC Relays Incorporated into a Distributed Generation-Based Micro-Grid Using a Meta-Heuristic MVO Algorithm

Abdelsalam

Diab

2019

Energies

View full text Add to dashboard Cite

Distributed, generation-based micro-grids are increasingly being used in the build-up of the modern power system. However, the protection of these micro-grids has many challenges. One of the important challenges is the coordination of directional overcurrent (DOC) relays. The optimization of the coordination of DOC relays is considered a nonlinear programming problem with pre-defined constrains. In this paper, the problem of the optimal coordination of DOC relays is solved using a multi-verse optimization (MVO) algorithm which is inspired from cosmology science. The proposed algorithm is tested by applying it to Institute of Electrical and Electronics Engineers (IEEE) 3 bus and IEEE 9 bus networks. The performance of the proposed algorithm is compared with the particle swarm optimization (PSO) algorithm when applied to both networks. All results show that the performance of the MVO algorithm is better than PSO in terms of its reduction of both the overall operating time (OT) of DOC relays and the computational burden of the computer solving the optimization problem.

show abstract

Hybrid GSA‐SQP algorithm for optimal coordination of directional overcurrent relays

Cited by 93 publications

References 31 publications

Optimized settings of directional overcurrent relays in meshed power networks using stochastic fractal search algorithm

Optimized settings of directional overcurrent relays in meshed power networks using stochastic fractal search algorithm

Coordination of mixed distance and directional overcurrent relays: Miscoordination elimination by utilizing dual characteristics for DOCRs

Optimal Coordination of DOC Relays Incorporated into a Distributed Generation-Based Micro-Grid Using a Meta-Heuristic MVO Algorithm

Contact Info

Product

Resources

About