Most Valuable Player Algorithm for Solving Direction Overcurrent Relays Coordination Problem

Ahmed Korashy, S. Kamel, Abdel‐Raheem Youssef, F. Jurado
{"title":"Most Valuable Player Algorithm for Solving Direction Overcurrent Relays Coordination Problem","authors":"Ahmed Korashy, S. Kamel, Abdel‐Raheem Youssef, F. Jurado","doi":"10.1109/ITCE.2019.8646537","DOIUrl":null,"url":null,"abstract":"This paper proposes the application of Most Valuable Player Algorithm (MVPA) to find the optimal solution for directional overcurrent relays (DOCRs) coordination problem. The coordination problem of DOCRs is considered as a non-linear optimization problem. The decision variables for this problem are relay settings. Minimize the summation of the operating times of all primary relays with maintaining the coordination margin between relays pairs is the main goal of this study. The feasibility and performance of the proposed algorithm for solving the coordination problem of DOCRs are assessed in two test system (8-bus and IEEE-30 bus). The results show the ability of the proposed algorithm for solving DOCRs coordination problem without any miscoordination. The results of the proposed optimization algorithm are compared with other previously optimization techniques.","PeriodicalId":391488,"journal":{"name":"2019 International Conference on Innovative Trends in Computer Engineering (ITCE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Innovative Trends in Computer Engineering (ITCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCE.2019.8646537","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

This paper proposes the application of Most Valuable Player Algorithm (MVPA) to find the optimal solution for directional overcurrent relays (DOCRs) coordination problem. The coordination problem of DOCRs is considered as a non-linear optimization problem. The decision variables for this problem are relay settings. Minimize the summation of the operating times of all primary relays with maintaining the coordination margin between relays pairs is the main goal of this study. The feasibility and performance of the proposed algorithm for solving the coordination problem of DOCRs are assessed in two test system (8-bus and IEEE-30 bus). The results show the ability of the proposed algorithm for solving DOCRs coordination problem without any miscoordination. The results of the proposed optimization algorithm are compared with other previously optimization techniques.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解方向过流继电器协调问题的最有价值参与人算法
本文提出应用最有价值玩家算法(MVPA)求解定向过流继电器(docr)协调问题的最优解。docr的协调问题被认为是一个非线性优化问题。这个问题的决策变量是继电器设置。在保持继电器对协调余量的前提下,使所有主继电器的操作时间总和最小是本研究的主要目标。在8总线和IEEE-30总线两个测试系统中,对所提算法解决docr协调问题的可行性和性能进行了评估。实验结果表明,该算法能够有效地解决docr协调问题,且不存在任何失配现象。将所提出的优化算法的结果与以往的其他优化技术进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
System Design and Implementation of Wall Climbing Robot for Wind Turbine Blade Inspection Application of Fuzzy Logic on Astronomical Images Focus Measure Comparative Evaluation of PWM Techniques Used at Mega 328/p with PI Control for Inverter-Fed Induction Motor Simulating The Thermoelectric Behaviour of CNT Based Harvester Characterization of the sources of degradation in remote sensing satellite images
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1