基于萤火虫算法的最优潮流

K. Karboune, I. Chaib, S. Arif, A. Choucha
{"title":"基于萤火虫算法的最优潮流","authors":"K. Karboune, I. Chaib, S. Arif, A. Choucha","doi":"10.21608/idj.2021.216606","DOIUrl":null,"url":null,"abstract":"In this paper, the Firefly Algorithm (FA) is proposed to find the optimal solution for the Optimal Power Flow (OPF) problem in a power system. The proposed algorithm is applied to determine the optimal settings of control variables of the OPF problem. The performance of the proposed algorithm was examined and tested on the standard IEEE 30bus test system with different objective functions and compared to other methods reported in the literature recently. Simulation results clearly obtained from the proposed (FA) approach indicated that (FA) provides an effective and robust high-quality solution for the OPF problem.","PeriodicalId":37830,"journal":{"name":"International Journal of Development Issues","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Power Flow Using firefly-algorithm\",\"authors\":\"K. Karboune, I. Chaib, S. Arif, A. Choucha\",\"doi\":\"10.21608/idj.2021.216606\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the Firefly Algorithm (FA) is proposed to find the optimal solution for the Optimal Power Flow (OPF) problem in a power system. The proposed algorithm is applied to determine the optimal settings of control variables of the OPF problem. The performance of the proposed algorithm was examined and tested on the standard IEEE 30bus test system with different objective functions and compared to other methods reported in the literature recently. Simulation results clearly obtained from the proposed (FA) approach indicated that (FA) provides an effective and robust high-quality solution for the OPF problem.\",\"PeriodicalId\":37830,\"journal\":{\"name\":\"International Journal of Development Issues\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Development Issues\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21608/idj.2021.216606\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Social Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Development Issues","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21608/idj.2021.216606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了求解电力系统最优潮流问题的萤火虫算法(FA)。将该算法应用于确定OPF问题控制变量的最优设置。在具有不同目标函数的标准IEEE 30bus测试系统上对所提算法的性能进行了测试,并与近期文献报道的其他方法进行了比较。仿真结果表明,该方法为OPF问题提供了一种有效、鲁棒的高质量解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal Power Flow Using firefly-algorithm
In this paper, the Firefly Algorithm (FA) is proposed to find the optimal solution for the Optimal Power Flow (OPF) problem in a power system. The proposed algorithm is applied to determine the optimal settings of control variables of the OPF problem. The performance of the proposed algorithm was examined and tested on the standard IEEE 30bus test system with different objective functions and compared to other methods reported in the literature recently. Simulation results clearly obtained from the proposed (FA) approach indicated that (FA) provides an effective and robust high-quality solution for the OPF problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Development Issues
International Journal of Development Issues Social Sciences-Political Science and International Relations
CiteScore
2.90
自引率
0.00%
发文量
20
期刊介绍: The International Journal of Development Issues (IJDI) publishes scholarly research on important development issues, with a particular focus on development dynamism and a leaning towards inter-disciplinary research. IJDI welcomes papers that are empirically oriented but such work should have solid methodological foundations based on realism and pragmatism rather than on idealism. Critical analysis of development issues from both the heteredox viewpoint and the neo-liberalist viewpoint, in orthodox tradition, are equally encouraged. The journal publishes authoritative, intelligent articles and research of direct relevance to those investigating and/or working within areas closely associated with development processes. Special consideration is given to research papers that consider development issues from either a socio-economic, political, historical or sociological, anthropological, ecological and technological standpoint.
期刊最新文献
Accurate targeting in social assistance programs in Southern Madagascar Impact of government expenditure on unemployment in Asian countries: does institutional quality matter? Estimating vulnerability to income and multidimensional poverty: a new methodological approach Natural resource rent's effect on Ethiopian inequality and manufacturing's moderating role: evidence from dynamic simulated ARDL model Trade, gender equality and institutional quality: Evidence from the gravitational approach
×
引用
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