Determining optimum time multiplier setting of overcurrent relays using modified Jaya algorithm

Application of modified Jaya algorithm for determining the optimum value of time multiplier setting (TMS) of overcurrent relays (OCRs) has been presented in this paper. The OCR time coordination in power distribution network is of great importance as it reduces the power outages by avoiding the backup relays mal-operation. For this, the optimum value of TMS of OCRs should be chosen. The problem of finding them value of TMS of OCRs, so as to give time of clearing the fault, can be formulated as an optimization problem with constrains. The objective is to find optimum value of TMS of OCRs to minimize the time of operation of relays under the constraint of maintaining the coordination of relays. Jaya algorithm is a recently proposed simple algorithm which can be used for solving unconstrained as well as constrained optimization problems. The main contribution of this paper is modification in the original Jaya algorithm and application of modified Jaya algorithm to find optimum value of TMS of OCRs. The results obtained are compared with those obtained using genetic algorithm (GA). It has been shown that the modified Jaya algorithm outperforms the GA.

[1]  A. J. Urdaneta,et al.  Coordination of directional overcurrent relay timing using linear programming , 1996 .

[2]  Hossein Askarian Abyaneh,et al.  A new comprehensive genetic algorithm method for optimal overcurrent relays coordination , 2008 .

[3]  Y. G. Paithankar,et al.  Fundamentals of Power System Protection , 2004, Optimal Coordination of Power Protective Devices with Illustrative Examples.

[4]  Vijay S. Kale,et al.  Optimum Time Coordination of Overcurrent Relays in Distribution System Using BigM (Penalty) Method , 2009 .

[5]  Vijay S. Kale,et al.  Optimum coordination of overcurrent relays in distribution system using genetic algorithm , 2009, 2009 International Conference on Power Systems.

[6]  H.O. Gupta,et al.  An Approach to Tackle the Threat of Sympathy Trips in Directional Overcurrent Relay Coordination , 2007, IEEE Transactions on Power Delivery.

[7]  R. Venkata Rao,et al.  A new optimization algorithm for solving complex constrained design optimization problems , 2017 .

[8]  A. J. Urdaneta,et al.  Optimal coordination of directional overcurrent relays in interconnected power systems , 1988 .

[9]  Hari Om Gupta,et al.  Time-Overcurrent Relay Coordination: A Review , 2005 .

[10]  Ismail Musirin,et al.  Optimal Overcurrent Relay Coordination: A Review , 2013 .

[11]  K. K. Li,et al.  Overcurrent relay coordination by evolutionary programming , 2000 .

[12]  Vijay S. Kale,et al.  Optimum Time Coordination of Overcurrent Relays using Two Phase Simplex Method , 2009 .

[13]  Vijay S. Kale,et al.  Optimum Coordination of Overcurrent Relay Timing Using Simplex Method , 2010 .

[14]  S. R. Bhide,et al.  Optimum Coordination of Directional Overcurrent Relays Using the Hybrid GA-NLP Approach , 2011, IEEE Transactions on Power Delivery.

[15]  Prashant P. Bedekar,et al.  Optimum coordination of overcurrent relay timing using continuous genetic algorithm , 2011, Expert Syst. Appl..

[16]  R. Rao.  Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems , 2016 .