基于CSA-CRO混合算法的UPFC技术经济优化布局

Deepro Sen, P. Acharjee
{"title":"基于CSA-CRO混合算法的UPFC技术经济优化布局","authors":"Deepro Sen, P. Acharjee","doi":"10.1109/APPEEC.2017.8308909","DOIUrl":null,"url":null,"abstract":"This paper employs a hybridization of cuckoo search algorithm (CSA) and chemical reaction optimization (CRO) for determining the optimal location of a unified power flow controller (UPFC) in the standard IEEE 30-bus power system network operating under arbitrarily increased load in random load buses to simulate the unpredictability and challenges of a power system transmission network. Lévy Flight and Random Walk techniques of the CSA are used with the collision techniques of CRO in such a way that, in each iteration, a balance is maintained between exploration and exploitation. The proposed algorithm is applied to determine the UPFC location in the system based on voltage quality, active and reactive power losses and installation cost. The results obtained show that the proposed algorithm is adept in handling non-linear and non-convex optimization problems within the boundaries of various equality and inequality constraints of the system as well as that of the UPFC.","PeriodicalId":247669,"journal":{"name":"2017 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Optimal placement of UPFC based on techno-economic criteria by hybrid CSA-CRO algorithm\",\"authors\":\"Deepro Sen, P. Acharjee\",\"doi\":\"10.1109/APPEEC.2017.8308909\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper employs a hybridization of cuckoo search algorithm (CSA) and chemical reaction optimization (CRO) for determining the optimal location of a unified power flow controller (UPFC) in the standard IEEE 30-bus power system network operating under arbitrarily increased load in random load buses to simulate the unpredictability and challenges of a power system transmission network. Lévy Flight and Random Walk techniques of the CSA are used with the collision techniques of CRO in such a way that, in each iteration, a balance is maintained between exploration and exploitation. The proposed algorithm is applied to determine the UPFC location in the system based on voltage quality, active and reactive power losses and installation cost. The results obtained show that the proposed algorithm is adept in handling non-linear and non-convex optimization problems within the boundaries of various equality and inequality constraints of the system as well as that of the UPFC.\",\"PeriodicalId\":247669,\"journal\":{\"name\":\"2017 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APPEEC.2017.8308909\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APPEEC.2017.8308909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文采用布谷鸟搜索算法(CSA)和化学反应优化算法(CRO)相结合的方法,确定统一潮流控制器(UPFC)在标准IEEE 30总线随机负荷母线任意增加负荷下运行的最优位置,以模拟电力系统输电网的不可预测性和挑战性。CSA的lsamvy Flight和Random Walk技术与CRO的碰撞技术结合使用,在每次迭代中,都能保持探索和利用之间的平衡。将该算法应用于基于电压质量、有功和无功损耗以及安装成本确定UPFC在系统中的位置。结果表明,该算法能较好地处理系统和UPFC的各种不等式约束边界内的非线性和非凸优化问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal placement of UPFC based on techno-economic criteria by hybrid CSA-CRO algorithm
This paper employs a hybridization of cuckoo search algorithm (CSA) and chemical reaction optimization (CRO) for determining the optimal location of a unified power flow controller (UPFC) in the standard IEEE 30-bus power system network operating under arbitrarily increased load in random load buses to simulate the unpredictability and challenges of a power system transmission network. Lévy Flight and Random Walk techniques of the CSA are used with the collision techniques of CRO in such a way that, in each iteration, a balance is maintained between exploration and exploitation. The proposed algorithm is applied to determine the UPFC location in the system based on voltage quality, active and reactive power losses and installation cost. The results obtained show that the proposed algorithm is adept in handling non-linear and non-convex optimization problems within the boundaries of various equality and inequality constraints of the system as well as that of the UPFC.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A novel modulation strategy for active rectification of a snubber less soft-switched single stage 30 high frequency link DC-AC converter Implementation of social spider optimization for optimized hydel-thermic operational delineation Frequency Response Analysis (FRA) in power transformers: An approach to locate inter-disk SC fault Fault estimation with analytical cable model for MMC-HVDC in offshore applications Modified current control technique for grid synchronization in voltage source converters
×
引用
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