Determining Optimum Time Multiplier Setting of Overcurrent Relays Using Modified Jaya Algorithm

被引:0
作者
Bedekar, Prashant P. [1 ]
Korde, Pragati N. [2 ]
机构
[1] Govt Coll Engn, Elect Engn Dept, Amravati, India
[2] GH Raisoni Inst Engn & Technol, Elect Engn Dept, Pune, Maharashtra, India
来源
2017 INNOVATIONS IN POWER AND ADVANCED COMPUTING TECHNOLOGIES (I-PACT) | 2017年
关键词
Backup protection; Constrained optimization; Overcurrent relay coordination; Jaya algorithm; Modified Jaya algorithm; INTERCONNECTED POWER-SYSTEMS; COORDINATION;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页数:6
相关论文
共 47 条