A tuned cuckoo search algorithm for optimal coordination of Directional Overcurrent Relays

G. Darji, M. Patel, V. Rajput, K. Pandya
{"title":"A tuned cuckoo search algorithm for optimal coordination of Directional Overcurrent Relays","authors":"G. Darji, M. Patel, V. Rajput, K. Pandya","doi":"10.1109/ICPACE.2015.7274936","DOIUrl":null,"url":null,"abstract":"The precise coordination of Directional Overcurrent Relays (DOCRs) is required to identify fault timely, effectively and isolate them from the network to avoid possible outages in a power system. The DOCRs coordination is an optimization problem including highly nonlinear constraints. In this paper, Cuckoo Search Algorithm (CSA) is implemented to solve coordination problem of DOCRs on two different case studies. The parameters of CSA are effectively tuned to obtain global best solution for the DOCRs coordination problem. The obtained results using the proposed method are compared with Genetic Algorithm (GA) and hybrid GA-Nonlinear programming (GA-NLP) methods. The result shows that the effective modification of CSA parameters can obtain feasible and superior solution for this complex problem.","PeriodicalId":6644,"journal":{"name":"2015 International Conference on Power and Advanced Control Engineering (ICPACE)","volume":"17 1","pages":"162-167"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Power and Advanced Control Engineering (ICPACE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPACE.2015.7274936","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

The precise coordination of Directional Overcurrent Relays (DOCRs) is required to identify fault timely, effectively and isolate them from the network to avoid possible outages in a power system. The DOCRs coordination is an optimization problem including highly nonlinear constraints. In this paper, Cuckoo Search Algorithm (CSA) is implemented to solve coordination problem of DOCRs on two different case studies. The parameters of CSA are effectively tuned to obtain global best solution for the DOCRs coordination problem. The obtained results using the proposed method are compared with Genetic Algorithm (GA) and hybrid GA-Nonlinear programming (GA-NLP) methods. The result shows that the effective modification of CSA parameters can obtain feasible and superior solution for this complex problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种定向过流继电器优化协调的调谐布谷鸟搜索算法
定向过流继电器(Directional Overcurrent继电器,docr)需要精确的协调才能及时、有效地识别故障并将其与电网隔离,以避免电力系统可能发生的中断。DOCRs协调是一个包含高度非线性约束的优化问题。本文采用布谷鸟搜索算法(Cuckoo Search Algorithm, CSA)对两个不同的案例进行求解。通过对CSA参数的有效调整,得到了DOCRs协调问题的全局最优解。将该方法与遗传算法(GA)和遗传-非线性混合规划(GA- nlp)方法进行了比较。结果表明,对CSA参数进行有效的修正可以得到这一复杂问题的可行、优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Asset management in smart grids using improved Dissolved Gas Analysis PLC based intelligent power factor correctors for industrial power systems-A case study A multiple environment dispatch problem solution using ant colony optimization for micro-grids Modeling, simulation and comparative study of new compound alloy based P-I-N solar cells - An efficient way of energy management Modeling and analysis of 6 pulse rectifier used in HVDC link
×
引用
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