Application of the JAYA Algorithm in Solving the Problem of the Optimal Coordination of Overcurrent Relays in Single‐ and Multi‐Loop Distribution Systems

Abstract

To ensure a safe and trustworthy pattern in contradiction to the possible faults, a precise, reliable, and fast relaying strategy is of high importance in an electrical power system. These challenges give the impression of being more refined in multi-loop distribution systems. More recently, overcurrent relays (OCRs) have evolved as proficient counteragents for such cases. In this way, inaugurating an optimal protection coordination strategy is accepted as the primary precondition in guaranteeing the safe protection of the coordination strategy. This study is aimed at lessening the overall operational time of the main relays in order to reduce the power outages. The coordination problem is conducted by adjusting only one parameter, namely the time multiplier setting (TMS). In electrical power relaying coordination, the objective function to be minimized is the sum of the overall operational time of the main relays. In the prescribed work, the coordination of the OCRs in the single- and multi-loop distribution network is realized as an optimization issue. The optimization is accomplished by means of JAYA algorithm. The suggested technique depends on the idea that the result acquired for a certain issue ought to pass near the finest result and avert the worst result. This technique involves only the common control factors and does not involve specific control factors. JAYA is adopted to OCR problem and run 20 times with the same initial condition for each case study, and it has been realized that for every run, the JAYA algorithm converges to the global optimum values requiring less number of iterations and computational time. The results obtained from JAYA algorithm are compared with other evolutionary and up-to-date algorithms, and it was determined that JAYA outperforms the other techniques.

An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications

“…Electrical and power system optimization problems are tackled by JAYA algorithm and its modifications. This includes optimal power flow solution [47,48,138], reactive power dispatch [129], directional over current relays Hybrid JAYA Carbon fiber-reinforced polymer Hybrid Continuous [156] Modified JAYA Glass fiber reinforced polymer Modified Continuous [93] QO-Jaya Optimization of submerged arc welding process parameters Modified Continuous [170] QO-Jaya Optimisation of welding processes Modified Continuous [173] QO-Jaya Optimization of Casting Processes Multi-objective Continuous [126] Hybrid JAYA Wire electric discharge machining Hybrid Continuous [107] coordination problem [103,152], and thermal systems optimisation.…”

An Optimized Adaptive Protection Scheme for Numerical and Directional Overcurrent Relay Coordination Using Harris Hawk Optimization

“…Here, E o is the energy of prey at the initial state, given by Equation (10). t is the current iteration and T indicates the total number of iterations and r 6 is a random number which varies between 0 and 1.…”

“…The minimum break point set method has been used for an expert system in [3]. For DOCR coordination problems [4][5][6][7][8] and complex problems within the electrical power network, numerous techniques like the Nature-inspired optimization technique whale optimization [9] and the JAYA algorithm [10] have been developed to deal with the DOCR problem. With respect to the physical and logical change of arrangement of the system the optimal DOCR design was developed in [11,12].…”

Hybridization of PSO for the Optimal Coordination of Directional Overcurrent Protection Relays

“…Different characteristics of particle swarm optimizations (PSO) to find the optimal DOPRs were presented in [20][21][22]. There are also many techniques used for the optimal coordination of DOPRs and for optimal settings such as pattern search optimization (PS) [23], gray wolf optimization [24], invasive weed optimization (IWO) [25], electromagnetic field optimization (EFO) [26], jaya algorithm [27][28][29], whale optimization [30], and root tree algorithm [31], among others. These optimization methods perform better when the problem is simple, but if the problem is complex or any changes in topologies occur, than these algorithms show abnormalities such as more computational and convergence time [16].…”