Abstract
The model of directional over current relays (DOCRs) coordination is considered as an optimization problem. It is generally formulated as linear programming (LP), non-linear programming (NLP) and mixed integer non-linear programming (MINLP), according to the nature of the design variables. For each kind of formulation, the main goal is to minimize the summation of operating times of primary relays, by setting optimal values for decision variables as time dial setting (TDS) and pickup current setting (IP) or plug setting (PS). In this paper, we proposed an oppositional Jaya (OJaya) algorithm with distance-adaptive coefficient (DAC), to effectively solve the DOCRs coordination problem. Firstly, by oppositional learning (OL), the searching space of Jaya is expanded and the diversity of its population is strengthened; secondly, by DAC, the population's trends of running towards the best position and escaping from the worst position is accelerated. The performance of OJaya is evaluated by 3-bus, 8-bus, 9-bus and 15-bus testing systems, in aspects of convergence rate, objective function value, robustness and computation efficiency. The results indicate the effectiveness and superiority of OJaya in solving DOCRs coordination problems compared with standard Jaya.
Highlights
Relays coordination problem is of great importance for the operation of power systems
PSi stands for the plug setting, CTi stands for the CT ratio, so the pickup current IPi is calculated by Eq(3)
The optimum settings of time dial setting (TDS) obtained by Jaya, DJaya and oppositional Jaya (OJaya) are given in Table
Summary
Relays coordination problem is of great importance for the operation of power systems. Modern optimization algorithms were used to solve the DOCRs coordination problems. J. Yu et al.: OJaya Algorithm With DAC in Solving DOCRs Coordination Problem used in [5], [6], where the repair algorithm and non-random technique for initialization were introduced to the standard version. Jaya algorithm is a newly developed yet advanced heuristic algorithm proposed by Rao in [20] It is totally free from algorithm-specific parameters and only two common parameters are required, which are maximum number of iteration (Max_iter) and population size (N _pop). An oppositional Jaya (OJaya) algorithm with distance-adaptive coefficient (DAC) is proposed to solve the optimal coordination problem of DOCRs. Compared with standard Jaya, there are two improvements in OJaya. PSi stands for the plug setting, CTi stands for the CT ratio, so the pickup current IPi is calculated by Eq(3)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
