Adaptive coordination of overcurrent relays in active distribution networks utilizing a multi-objective optimization approach

A. Samadi, R. M. Chabanloo
{"title":"Adaptive coordination of overcurrent relays in active distribution networks utilizing a multi-objective optimization approach","authors":"A. Samadi, R. M. Chabanloo","doi":"10.1109/IPAPS49326.2019.9069388","DOIUrl":null,"url":null,"abstract":"Digital Overcurrent Relays (OCRs) can store multiple Setting Groups (SGs) to be capable of protecting different network states (NSTs) by changing the activated SG of OCRs when it's needed. Therefore, in a network with a high number of possible topologies and a high penetration factor of Distributed Generations (DGs), the number of required setting changes rises. There is always the risk of applying wrong settings to the OCRs in case of NST changes. The risk of applying wrong settings to the relays rises by the increment of setting changes. In this paper, NSTs are grouped and protected by one SG of OCRs in a way that the minimum number of setting changes are used considering all possible configuration changes and DGs connection/disconnection. Doing so reduces the possibility of activating the wrong SGs in OCRs by decreasing the number of setting changes. In this paper, a multi-objective optimization algorithm is proposed to find the optimum operation point considering the number of setting changes, the number of SGs and total protection time. It has shown in the results that the number of setting changes has been reduced a lot by using this paper's method.","PeriodicalId":230294,"journal":{"name":"2020 14th International Conference on Protection and Automation of Power Systems (IPAPS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 14th International Conference on Protection and Automation of Power Systems (IPAPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPAPS49326.2019.9069388","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Digital Overcurrent Relays (OCRs) can store multiple Setting Groups (SGs) to be capable of protecting different network states (NSTs) by changing the activated SG of OCRs when it's needed. Therefore, in a network with a high number of possible topologies and a high penetration factor of Distributed Generations (DGs), the number of required setting changes rises. There is always the risk of applying wrong settings to the OCRs in case of NST changes. The risk of applying wrong settings to the relays rises by the increment of setting changes. In this paper, NSTs are grouped and protected by one SG of OCRs in a way that the minimum number of setting changes are used considering all possible configuration changes and DGs connection/disconnection. Doing so reduces the possibility of activating the wrong SGs in OCRs by decreasing the number of setting changes. In this paper, a multi-objective optimization algorithm is proposed to find the optimum operation point considering the number of setting changes, the number of SGs and total protection time. It has shown in the results that the number of setting changes has been reduced a lot by using this paper's method.
基于多目标优化方法的有源配电网过流继电器自适应协调
数字过流继电器(ocr)可以存储多个设置组(SGs),以便在需要时通过改变ocr的激活SG来保护不同的网络状态(nst)。因此,在具有大量可能的拓扑结构和高分布式代(dg)渗透系数的网络中,所需的设置更改数量会增加。在NST更改的情况下,总是存在对ocr应用错误设置的风险。对继电器应用错误设置的风险随着设置变化的增加而增加。在本文中,nst由一个ocr SG分组和保护,考虑到所有可能的配置更改和dg连接/断开,使用最小数量的设置更改。这样做可以减少设置更改的次数,从而降低在ocr中激活错误SGs的可能性。本文提出了一种考虑整定次数、SGs次数和总保护时间的多目标优化算法,以寻找最优工作点。结果表明,采用本文的方法,大大减少了设置变化的次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信