Optimal active and Reactive Power dispatch problem solution using Moth-Flame Optimizer algorithm

Siddharth A. Parmar, M. Pandya, Motilal Bhoye, I. Trivedi, Pradeep Jangir, Dilip P. Ladumor
{"title":"Optimal active and Reactive Power dispatch problem solution using Moth-Flame Optimizer algorithm","authors":"Siddharth A. Parmar, M. Pandya, Motilal Bhoye, I. Trivedi, Pradeep Jangir, Dilip P. Ladumor","doi":"10.1109/ICEETS.2016.7583804","DOIUrl":null,"url":null,"abstract":"In this work, the most common problem of the modern power system named optimal power flow (OPF) is optimized using the novel meta-heuristic optimisation algorithm Moth-Flame Optimizer (MFO). MFO is inspired by the navigation strategy of Moths in universe. MFO has a fast convergence rate due to use of roulette wheel selection method. In order to resolve the optimal power flow problem, standard IEEE-30 bus system is used. MFO is implemented for the solution of proposed problem. The problems considered in the OPF problem are Fuel Cost Reduction, Active Power Loss Minimization, and Reactive Power Loss Minimization. The results obtained by MFO is compared with other techniques such as Flower Pollination Algorithm (FPA) and Particle Swarm Optimizer (PSO). Results shows that MFO gives better optimisation values as compared with FPA and PSO that confirms the effectiveness of the suggested algorithm.","PeriodicalId":215798,"journal":{"name":"2016 International Conference on Energy Efficient Technologies for Sustainability (ICEETS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Energy Efficient Technologies for Sustainability (ICEETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEETS.2016.7583804","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

In this work, the most common problem of the modern power system named optimal power flow (OPF) is optimized using the novel meta-heuristic optimisation algorithm Moth-Flame Optimizer (MFO). MFO is inspired by the navigation strategy of Moths in universe. MFO has a fast convergence rate due to use of roulette wheel selection method. In order to resolve the optimal power flow problem, standard IEEE-30 bus system is used. MFO is implemented for the solution of proposed problem. The problems considered in the OPF problem are Fuel Cost Reduction, Active Power Loss Minimization, and Reactive Power Loss Minimization. The results obtained by MFO is compared with other techniques such as Flower Pollination Algorithm (FPA) and Particle Swarm Optimizer (PSO). Results shows that MFO gives better optimisation values as compared with FPA and PSO that confirms the effectiveness of the suggested algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用飞蛾-火焰优化算法求解有功和无功优化调度问题
本文采用一种新的元启发式优化算法蛾焰优化器(MFO)对现代电力系统中最常见的最优潮流(OPF)问题进行了优化。MFO的灵感来自于飞蛾在宇宙中的导航策略。由于采用了轮盘赌选择方法,该算法具有较快的收敛速度。为了解决最优潮流问题,采用标准的IEEE-30总线系统。为了解决所提出的问题,采用了多目标优化算法。OPF问题考虑的问题是燃料成本降低、有功功率损耗最小化和无功功率损耗最小化。并将MFO算法的结果与花朵授粉算法(FPA)和粒子群优化算法(PSO)进行了比较。结果表明,与FPA和PSO相比,MFO给出了更好的优化值,证实了所提算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reduction of common mode voltage using multilevel inverter Simulation and analysis of energy harvesting from Grey water and rain water in high rises Economic Load Dispatch problem with ramp rate limits and prohibited operating zones solve using Levy flight Moth-Flame optimizer An improve efficiency of li-ion batteries with harmony search algorithm An insight to distributed generation of electrical energy from various renewable sources
×
引用
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