Optimal Distribution Networks Expansion Planning with DG for Power Losses Reduction

Hamza Mubarak, H. Mokhlis, Nurulafiqah Nadzirah Binti Mansor, Mahazani Mohamad, Anis Salwa Mohd Khairuddin, Suhail Afzal
{"title":"Optimal Distribution Networks Expansion Planning with DG for Power Losses Reduction","authors":"Hamza Mubarak, H. Mokhlis, Nurulafiqah Nadzirah Binti Mansor, Mahazani Mohamad, Anis Salwa Mohd Khairuddin, Suhail Afzal","doi":"10.1109/i-PACT52855.2021.9696699","DOIUrl":null,"url":null,"abstract":"This paper proposes an optimal distribution networks expansion planning (DNEP) considering costs minimization to expand the networks, DG installation, and power losses under N-1 contingencies for every branch in the network with different load profiles. The proposed strategy has the capability to determine critical branches that significantly impacting the system power losses in case of outages. Due to the complexity of the proposed problem, hybrid metaheuristic technique comprises of Firefly algorithm and Particle Swarm Optimization were applied. The IEEE 33 bus system was utilized to validate the performance of the proposed method. The results shown that some branches have a huge impact on power losses during the N-1 contingency analysis. In addition, the power losses are minimized by 14.32% when DG is optimally considered in the planning strategy in terms of its sizing and placement.","PeriodicalId":335956,"journal":{"name":"2021 Innovations in Power and Advanced Computing Technologies (i-PACT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Innovations in Power and Advanced Computing Technologies (i-PACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/i-PACT52855.2021.9696699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

This paper proposes an optimal distribution networks expansion planning (DNEP) considering costs minimization to expand the networks, DG installation, and power losses under N-1 contingencies for every branch in the network with different load profiles. The proposed strategy has the capability to determine critical branches that significantly impacting the system power losses in case of outages. Due to the complexity of the proposed problem, hybrid metaheuristic technique comprises of Firefly algorithm and Particle Swarm Optimization were applied. The IEEE 33 bus system was utilized to validate the performance of the proposed method. The results shown that some branches have a huge impact on power losses during the N-1 contingency analysis. In addition, the power losses are minimized by 14.32% when DG is optimally considered in the planning strategy in terms of its sizing and placement.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于DG的配电网优化扩容规划
本文提出了一种考虑成本最小化的配电网扩展规划(DNEP),以满足不同负荷分布下各支路在N-1突发事件下的网络扩展、DG安装和电力损耗。所提出的策略具有确定在停电情况下显著影响系统功率损失的关键分支的能力。考虑到问题的复杂性,采用了萤火虫算法和粒子群算法相结合的混合元启发式算法。利用IEEE 33总线系统验证了所提方法的性能。结果表明,在N-1权变分析中,部分支路对电力损耗的影响较大。此外,在规划策略中考虑DG的大小和位置时,功率损耗降低了14.32%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Abnormality Detection in Humerus Bone Radiographs Using DenseNet Random Optimal Search Based Significant Gene Identification and Classification of Disease Samples Co-Design Approach of Converter Control for Battery Charging Electric Vehicle Applications Typical Analysis of Different Natural Esters and their Performance: A Review Machine Learning-Based Medium Access Control Protocol for Heterogeneous Wireless Networks: A Review
×
引用
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