Optimal DG allocation for minimizing active power loss with better computational speed and high accuracy

Arnab Pal, A. Chakraborty, A. Bhowmik, Bhaskar Bhattacharya
{"title":"Optimal DG allocation for minimizing active power loss with better computational speed and high accuracy","authors":"Arnab Pal, A. Chakraborty, A. Bhowmik, Bhaskar Bhattacharya","doi":"10.1109/RAIT.2018.8389009","DOIUrl":null,"url":null,"abstract":"This paper presents the optimal allocation of Distributed Generation (DG) units in a distribution network for minimization of active power loss with less execution time and with better accuracy. The DG allocation problem is formulated as a non-linear constrained optimization problem where power loss has been taken as objective and various constraints have been considered into the formulation. In this work, a new algorithm, one by one search algorithm (OBOSA), to find out the DG locations for minimum power loss has been proposed. To show the effectiveness of the proposed algorithm, it has been tested on a standard IEEE 33 and 69 radial distribution test bus systems. The performance of OBOSA is compared with the results found by grey wolf optimization (GWO) and ant lion optimization (ALO) based techniques. Numerical results demonstrate the tangible superiority of the proposed method in achieving the optimum DG allocation with better computational speed and high accuracy.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"434 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAIT.2018.8389009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This paper presents the optimal allocation of Distributed Generation (DG) units in a distribution network for minimization of active power loss with less execution time and with better accuracy. The DG allocation problem is formulated as a non-linear constrained optimization problem where power loss has been taken as objective and various constraints have been considered into the formulation. In this work, a new algorithm, one by one search algorithm (OBOSA), to find out the DG locations for minimum power loss has been proposed. To show the effectiveness of the proposed algorithm, it has been tested on a standard IEEE 33 and 69 radial distribution test bus systems. The performance of OBOSA is compared with the results found by grey wolf optimization (GWO) and ant lion optimization (ALO) based techniques. Numerical results demonstrate the tangible superiority of the proposed method in achieving the optimum DG allocation with better computational speed and high accuracy.
优化DG分配,使有功功率损耗最小,计算速度更快,精度更高
本文提出了一种分布式发电机组在配电网中的优化配置方法,以实现有功损耗最小、运行时间短、精度高的目标。将DG分配问题表述为一个以功率损失为目标,考虑各种约束条件的非线性约束优化问题。本文提出了一种新的算法,即逐点搜索算法(OBOSA),以寻找功率损耗最小的DG位置。为了验证该算法的有效性,在标准的IEEE 33和69径向分布测试总线系统上进行了测试。将OBOSA的性能与基于灰狼优化(GWO)和蚁狮优化(ALO)的结果进行了比较。数值结果表明,该方法在实现DG优化分配方面具有明显的优势,计算速度快,精度高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信