Optimal Setting of Overcurrent Relay on Industrial Power System Using Particle Swarm Optimization

Miftakhul Fauzia Hakim, M. Pujiantara, V. Lystianingrum
{"title":"Optimal Setting of Overcurrent Relay on Industrial Power System Using Particle Swarm Optimization","authors":"Miftakhul Fauzia Hakim, M. Pujiantara, V. Lystianingrum","doi":"10.1109/CENIM56801.2022.10037484","DOIUrl":null,"url":null,"abstract":"Overcurrent relay (OCR) setting in the industrial power system is a challenge for some engineers. The problem is not only determining the curve type and the value of the time dial setting (TDS) but also the number of relays that must be set. The relays are installed starting from the load side (downstream) to the power source (upstream). Thus, it takes a long time to set all the installed relays. One of solution to this problem is changing the form of the relay setting problem into an optimization problem. Recently, many studies have been using particle swarm optimization (PSO) to solve optimization problems. However, there are still few of them that use PSO to optimize relay setting problems in an industrial power system. This paper uses PSO as an optimization algorithm to solve OCR setting problem. PSO is a swarm-based algorithm that is easy to implement for various optimization problems but has some drawbacks in solving problems. Therefore, this paper proposes a new form of adaptive PSO, namely modified adaptive particle swarm optimization (MAPSO). In contrast to PSO, the MAPSO algorithm provides more optimal results than the original PSO.","PeriodicalId":118934,"journal":{"name":"2022 International Conference on Computer Engineering, Network, and Intelligent Multimedia (CENIM)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Computer Engineering, Network, and Intelligent Multimedia (CENIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CENIM56801.2022.10037484","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Overcurrent relay (OCR) setting in the industrial power system is a challenge for some engineers. The problem is not only determining the curve type and the value of the time dial setting (TDS) but also the number of relays that must be set. The relays are installed starting from the load side (downstream) to the power source (upstream). Thus, it takes a long time to set all the installed relays. One of solution to this problem is changing the form of the relay setting problem into an optimization problem. Recently, many studies have been using particle swarm optimization (PSO) to solve optimization problems. However, there are still few of them that use PSO to optimize relay setting problems in an industrial power system. This paper uses PSO as an optimization algorithm to solve OCR setting problem. PSO is a swarm-based algorithm that is easy to implement for various optimization problems but has some drawbacks in solving problems. Therefore, this paper proposes a new form of adaptive PSO, namely modified adaptive particle swarm optimization (MAPSO). In contrast to PSO, the MAPSO algorithm provides more optimal results than the original PSO.
基于粒子群算法的工业电力系统过流继电器优化整定
工业电力系统中的过流继电器(OCR)整定是一个难题。问题不仅在于确定曲线类型和时间拨盘设置(TDS)的值,而且还在于必须设置的继电器数量。继电器从负载侧(下游)安装到电源(上游)。因此,设置所有已安装的继电器需要很长时间。解决这一问题的方法之一是将继电器整定问题的形式转化为优化问题。近年来,许多研究都将粒子群算法(PSO)用于求解优化问题。然而,利用粒子群算法优化工业电力系统中继电整定问题的研究还很少。本文将粒子群算法作为一种优化算法来解决OCR设置问题。粒子群优化算法是一种基于群的优化算法,对于各种优化问题易于实现,但在求解问题时存在一定的缺陷。为此,本文提出了一种新的自适应粒子群算法,即修正自适应粒子群算法(MAPSO)。与粒子群算法相比,MAPSO算法提供了比原粒子群算法更多的最优结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信