基于改进Jaya算法的过流继电器优化协调

P. Bedekar, P. Korde
{"title":"基于改进Jaya算法的过流继电器优化协调","authors":"P. Bedekar, P. Korde","doi":"10.1109/UPCON.2016.7894701","DOIUrl":null,"url":null,"abstract":"Application of modified Jaya algorithm for determining the optimum time multiplier setting (TMS) and plug setting (PS) of overcurrent relays (OCRs) is presented in this paper. The OCR time coordination is of great importance as it reduces the power outages by avoiding the backup relays to mal-operate. For this, the OCRs should have PS and TMS values set to their optimum values. Setting the PS and TMS of OCRs to their optimum values can be formulated as a constrained nonlinear optimization problem. The objective is to find the value of PS and TMS of OCRs so as to make the time of operation of relays as minimum as possible. This is to be achieved under the constraint of maintaining the coordination of relays. Jaya algorithm is a recently proposed simple optimization technique which can be used for solving the constrained optimization problems. The main contribution of this paper is modification in the original Jaya algorithm and application of modified Jaya algorithm to determine the values of PS and TMS of OCRs, which are optimum. The results are compared with the results obtained using genetic algorithm (GA). It has been shown that the modified Jaya algorithm outperforms the GA. Also it is shown that the problem can be decomposed in parts to reduce the complexity without loss of accuracy.","PeriodicalId":151809,"journal":{"name":"2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Optimum coordination of overcurrent relays using the modified Jaya algorithm\",\"authors\":\"P. Bedekar, P. Korde\",\"doi\":\"10.1109/UPCON.2016.7894701\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Application of modified Jaya algorithm for determining the optimum time multiplier setting (TMS) and plug setting (PS) of overcurrent relays (OCRs) is presented in this paper. The OCR time coordination is of great importance as it reduces the power outages by avoiding the backup relays to mal-operate. For this, the OCRs should have PS and TMS values set to their optimum values. Setting the PS and TMS of OCRs to their optimum values can be formulated as a constrained nonlinear optimization problem. The objective is to find the value of PS and TMS of OCRs so as to make the time of operation of relays as minimum as possible. This is to be achieved under the constraint of maintaining the coordination of relays. Jaya algorithm is a recently proposed simple optimization technique which can be used for solving the constrained optimization problems. The main contribution of this paper is modification in the original Jaya algorithm and application of modified Jaya algorithm to determine the values of PS and TMS of OCRs, which are optimum. The results are compared with the results obtained using genetic algorithm (GA). It has been shown that the modified Jaya algorithm outperforms the GA. Also it is shown that the problem can be decomposed in parts to reduce the complexity without loss of accuracy.\",\"PeriodicalId\":151809,\"journal\":{\"name\":\"2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UPCON.2016.7894701\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UPCON.2016.7894701","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文应用改进的Jaya算法确定过流继电器(ocr)的最佳时间乘法器(TMS)和插头整定(PS)。OCR时间协调通过避免备用继电器误动作来减少停电,具有重要的意义。为此,ocr应该将PS和TMS值设置为最优值。将ocr的PS和TMS设为最优值可表述为一个约束非线性优化问题。目的是找出ocr的PS和TMS值,从而使继电器的操作时间尽可能短。这是在保持继电器协调的约束下实现的。Jaya算法是近年来提出的一种用于求解约束优化问题的简单优化技术。本文的主要贡献是对原有的Jaya算法进行了改进,并应用改进的Jaya算法确定了ocr的PS和TMS值,这两个值是最优的。将所得结果与遗传算法(GA)进行了比较。实验表明,改进的Jaya算法优于遗传算法。在不损失精度的前提下,可以将问题分解为多个部分来降低复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimum coordination of overcurrent relays using the modified Jaya algorithm
Application of modified Jaya algorithm for determining the optimum time multiplier setting (TMS) and plug setting (PS) of overcurrent relays (OCRs) is presented in this paper. The OCR time coordination is of great importance as it reduces the power outages by avoiding the backup relays to mal-operate. For this, the OCRs should have PS and TMS values set to their optimum values. Setting the PS and TMS of OCRs to their optimum values can be formulated as a constrained nonlinear optimization problem. The objective is to find the value of PS and TMS of OCRs so as to make the time of operation of relays as minimum as possible. This is to be achieved under the constraint of maintaining the coordination of relays. Jaya algorithm is a recently proposed simple optimization technique which can be used for solving the constrained optimization problems. The main contribution of this paper is modification in the original Jaya algorithm and application of modified Jaya algorithm to determine the values of PS and TMS of OCRs, which are optimum. The results are compared with the results obtained using genetic algorithm (GA). It has been shown that the modified Jaya algorithm outperforms the GA. Also it is shown that the problem can be decomposed in parts to reduce the complexity without loss of accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信