Optimal Coordination of Directional Overcurrent Relays Using Enhanced L-SHADE Algorithm

Karam Husen Khan, Khagendra Bahadur Thapa, Nava Raj Karki
{"title":"Optimal Coordination of Directional Overcurrent Relays Using Enhanced L-SHADE Algorithm","authors":"Karam Husen Khan, Khagendra Bahadur Thapa, Nava Raj Karki","doi":"10.1109/POWERCON48463.2020.9230593","DOIUrl":null,"url":null,"abstract":"An optimization model based protection coordination method of directional overcurrent relays (DOCRs) in highly interconnected large size meshed power system network is a complex task due to its nature of highly constrained non-linear optimization problem. To overcome this complexity of DOCRs coordination, this paper proposes an optimal protection coordination of DOCRs considering optimal selection of standard time-current characteristic curves using enhanced linear population size reduction technique of success history based adaptive differential evolution (enhanced L-SHADE/eL-SHADE) algorithm which is an advanced version of differential evolution (DE) algorithm. The conventional L-SHADE algorithm is enhanced in three steps with a novel mutation strategy, incorporation of random local search by sequential quadratic programming and non-linear population size reduction scheme. Furthermore, an effectiveness of the proposed algorithm is validated by testing it on standard IEEE-30 bus and 57 bus meshed networks. A promising and highly competitive simulation results are obtained when compared with similar results presented in reference articles by other optimization algorithms. The evaluation criteria of the eL-SHADE algorithm is considered on the basis of objective function value, standard deviation, execution time and violation of constraints.","PeriodicalId":306418,"journal":{"name":"2020 IEEE International Conference on Power Systems Technology (POWERCON)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Power Systems Technology (POWERCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/POWERCON48463.2020.9230593","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

An optimization model based protection coordination method of directional overcurrent relays (DOCRs) in highly interconnected large size meshed power system network is a complex task due to its nature of highly constrained non-linear optimization problem. To overcome this complexity of DOCRs coordination, this paper proposes an optimal protection coordination of DOCRs considering optimal selection of standard time-current characteristic curves using enhanced linear population size reduction technique of success history based adaptive differential evolution (enhanced L-SHADE/eL-SHADE) algorithm which is an advanced version of differential evolution (DE) algorithm. The conventional L-SHADE algorithm is enhanced in three steps with a novel mutation strategy, incorporation of random local search by sequential quadratic programming and non-linear population size reduction scheme. Furthermore, an effectiveness of the proposed algorithm is validated by testing it on standard IEEE-30 bus and 57 bus meshed networks. A promising and highly competitive simulation results are obtained when compared with similar results presented in reference articles by other optimization algorithms. The evaluation criteria of the eL-SHADE algorithm is considered on the basis of objective function value, standard deviation, execution time and violation of constraints.
基于增强L-SHADE算法的定向过流继电器优化协调
基于优化模型的定向过流继电器(DOCRs)保护协调方法是一项复杂的任务,因为它是一个高度约束的非线性优化问题。为了克服docr协调的复杂性,本文利用基于成功历史的自适应差分进化(enhanced L-SHADE/eL-SHADE)算法的增强线性种群大小缩减技术,提出了一种考虑标准时间-电流特征曲线最优选择的docr最优保护协调算法,该算法是差分进化(DE)算法的改进版本。采用一种新颖的突变策略,结合序列二次规划的随机局部搜索和非线性种群大小缩减方案,对传统的L-SHADE算法进行了三步改进。在标准的IEEE-30总线和57总线网状网络上进行了测试,验证了算法的有效性。通过与其他优化算法的仿真结果进行比较,得到了具有较强竞争力的仿真结果。eL-SHADE算法的评价标准是根据目标函数值、标准差、执行时间和违反约束来考虑的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信