Optimum coordination of overcurrent relays in distribution system using genetic algorithm

Bedekar, Prashant P.; Bhide, Sudhir R.; Kale, Vijay

doi:10.1109/icpws.2009.5442716

Cited by 82 publications

(64 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Primary and backup are the two protection schemes incorporated in the radial system [10]. Sensitivity and Selectivity are two attributes of a relay that are of utmost importance for reliability and stability of any power system.…”

Section: Coordination Of Oc Relays In Radial Systemmentioning

confidence: 99%

Optimal coordination of overcurrent relays using gravitational search algorithm with DG penetration

Tripathi¹,

Adhishree²,

Krishan³

2014

2014 6th IEEE Power India International Conference (PIICON)

View full text Add to dashboard Cite

Modern distribution systems consist of various distributed generators (DG) to make reliable power system. In this DG integrated distribution systems, coordination of overcurrent relays is a big challenge for protection engineers. At addition of DG, distribution system experiences change in the short circuit level of the system and thus earlier relay settings causes mal operation of relays. Nowadays, various programming optimization techniques are frequently used to find optimal relay settings of overcurrent (OC) relays. This paper presents a comparative study of Particle Swarm Optimization (PSO) and Gravitational Search Algorithm for the coordination of overcurrent relay for a system containing DG. A proper combination of primary and backup relay is selected to avoid mal operation of relays and unwanted outages when DG is penetrated. A four bus radial system is simulated in PSCAD/EMTDC platform and programming is done using MATLAB software.

show abstract

Section: Coordination Of Oc Relays In Radial Systemmentioning

confidence: 99%

Optimal coordination of overcurrent relays using gravitational search algorithm with DG penetration

Tripathi¹,

Adhishree²,

Krishan³

2014

2014 6th IEEE Power India International Conference (PIICON)

View full text Add to dashboard Cite

show abstract

“…To avoid the complexity of the MINLP technique, the OCR coordination problem is commonly formulated as a linear programming problem (LPP). Various LPP techniques have been used [5][6][7][8] for OCR coordination. In [9,10], optimum coordination were obtained considering the configuration changes of the network.…”

Section: Introductionmentioning

confidence: 99%

“…Several optimization techniques have been proposed for optimum coordination of OCRs [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. In [3,4], the relay coordination problem was formulated as mixedinteger non-linear programming (MINLP) and solved using general algebraic modeling system (GAMS) software.…”

Section: Introductionmentioning

confidence: 99%

Optimum Coordination of Overcurrent Relay Timing Using Simplex Method

Bedekar

Bhide

Kale

2010

Electric Power Components and Systems

Self Cite

View full text Add to dashboard Cite

This article presents the simplex method for optimum time coordination of directional overcurrent relays. The main contribution of this article is the application of the simplex method in spite of the inherent unsuitability of the problem. This is achieved by applying the simplex algorithm to the dual of the problem. Furthermore, there are reductions in the number of calculations and memory requirement, as the artificial variables need not be introduced. A comparison with other variants of the simplex algorithm and the genetic algorithm is also presented. It has been shown that the proposed method is applicable for finding the optimum coordination, even when a variety of overcurrent relays is present in the system.

show abstract

“…These parameters can be calculated by several optimization methods, including linear programming [1][2][3][4][5][6][7][8], non-linear programming [9][10][11][12][13], as well as artificial intelligence [14][15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%

A New Algorithm to Avoid the Infeasibility of Linear Programming Techniques Used to Solve the Over-current Relays Coordination Problem

Ezzeddine

Kaczmarek

2011

Electric Power Components and Systems

View full text Add to dashboard Cite

This article analyzes the drawbacks of linear programming methods to solve the directional over-current relay coordination problem. The solution infeasibility of these methods is due to selectivity constraints, which reduce the upper bound of the time multiplier setting of some relays. This infeasibility can be avoided by making the upper bound of the time multiplier setting insensible to selectivity constraints. With the proposed algorithm based on this idea, the constraints causing infeasibility are identified in order to change their position in relation to possible solution areas. This change is achieved by increasing the relay pickup currents. The proposed algorithm is tested and evaluated on the IEEE 14-bus and 30-bus networks. The results show that the previously infeasible solution of linear programming becomes feasible with high efficiency.

show abstract

Optimum coordination of overcurrent relays in distribution system using genetic algorithm

Cited by 82 publications

References 6 publications

Optimal coordination of overcurrent relays using gravitational search algorithm with DG penetration

Optimal coordination of overcurrent relays using gravitational search algorithm with DG penetration

Optimum Coordination of Overcurrent Relay Timing Using Simplex Method

A New Algorithm to Avoid the Infeasibility of Linear Programming Techniques Used to Solve the Over-current Relays Coordination Problem

Contact Info

Product

Resources

About