Application of the JAYA Algorithm in Solving the Problem of the Optimal Coordination of Overcurrent Relays in Single- and Multi-Loop Distribution Systems. (22nd December 2019)

• Record Type: Journal Article
• Authors: Wadood, Abdul; Farkoush, Saeid Gholami; Khurshaid, Tahir; Yu, Jiang-Tao; Kim, Chang-Hwan; Rhee, Sang-Bong
• Other Names: Zhang Rongqing Academic Editor.
• Is Part Of: Complexity. Volume 2019(2019)
• Publication Date: 2019-12-22
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2019/5876318
• Languages: English
• ISSNs: 1076-2787

Abstract

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.