Polar wolf optimization algorithm for solving optimal reactive power problem

K. Lenin
{"title":"Polar wolf optimization algorithm for solving optimal reactive power problem","authors":"K. Lenin","doi":"10.11591/IJAPE.V9.I2.PP107-112","DOIUrl":null,"url":null,"abstract":"This paper proposes polar wolf optimization (PWO) algorithm to solve the optimal reactive power problem. Proposed algorithm enthused from actions of polar wolves. Leader’s wolves which denoted as  x α are accountable for taking judgment on hunting, resting place, time to awaken etc. second level is  x β those acts when there is need of substitute in first case. Then  x γ be as final level of the wolves. In the modeling social hierarchy is developed to discover the most excellent solutions acquired so far. Then the encircling method is used to describe circle-shaped vicinity around every candidate solutions. In order to agents work in a binary space, the position modernized accordingly. Proposed PWO algorithm has been tested in standard IEEE 14, 30, 57,118,300 bus test systems and simulation results show the projected algorithms reduced the real power loss considerably.","PeriodicalId":280098,"journal":{"name":"International Journal of Applied Power Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Power Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/IJAPE.V9.I2.PP107-112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper proposes polar wolf optimization (PWO) algorithm to solve the optimal reactive power problem. Proposed algorithm enthused from actions of polar wolves. Leader’s wolves which denoted as  x α are accountable for taking judgment on hunting, resting place, time to awaken etc. second level is  x β those acts when there is need of substitute in first case. Then  x γ be as final level of the wolves. In the modeling social hierarchy is developed to discover the most excellent solutions acquired so far. Then the encircling method is used to describe circle-shaped vicinity around every candidate solutions. In order to agents work in a binary space, the position modernized accordingly. Proposed PWO algorithm has been tested in standard IEEE 14, 30, 57,118,300 bus test systems and simulation results show the projected algorithms reduced the real power loss considerably.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解最优无功问题的极地狼优化算法
本文提出了一种求解最优无功问题的极狼优化算法。从极地狼的行动中提出了一种算法。领队的狼,记为x α,负责判断狩猎、休息地点、醒来时间等。第二级是x β,在第一种情况下,领队的狼在需要替补的情况下采取行动。那么x γ是狼的最终等级。在建模过程中,为了发现迄今为止获得的最优秀的解决方案,建立了社会层次结构。然后用包络法描述每个候选解周围的圆形区域。为了使代理在二进制空间中工作,位置也相应地现代化了。所提出的ppo算法已在标准IEEE 14、30、57、11、300总线测试系统中进行了测试,仿真结果表明,所提算法显著降低了实际功率损耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Squirrel Cage Induction Motor Predictive Direct Torque Control based on multi-step delay compensation Power quality improvement using a shunt active power filter based on an cascaded H-bridge eleven level inverter with predictive current control Calculation and measurement of ampacity for class 5 flexible aluminum cable at 110 °C Problems and analysis directions in smart grid technology and their potential solutions Performance enhancement of shunt active power filter using soft computing techniques
×
引用
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