基于Jaya算法的P, PQV总线配电网优化规划

Sumanth Pemmada, N. Patne, Ashwini D. Manchalwar, T. K. Ajay
{"title":"基于Jaya算法的P, PQV总线配电网优化规划","authors":"Sumanth Pemmada, N. Patne, Ashwini D. Manchalwar, T. K. Ajay","doi":"10.1109/ICPS52420.2021.9670411","DOIUrl":null,"url":null,"abstract":"This article performs reconfiguration of the distribution network (DN), including distributed generations (DGs) with a new set of buses P, PQV. P-bus is a reactive power support bus that maintains specific voltage at a minimum voltage bus, i.e., PQV-bus. Optimal locations of multiple DGs are determined using sensitivity factors based on reducing power loss and improvement in voltages. The capacity of reactive power support, ratings of DGs, and switching configuration are optimized by employing the recently developed Jaya algorithm. DGs accommodation is followed in sequential and non-sequential approaches. Topology constraints of reconfiguration are validated utilizing a spanning tree concept from smart graph theory. The following constraints are applied to study the problem: voltage limits at buses, current-carrying limits of lines, radial configuration, and no isolated node in the network. The proposed method's applicability is demonstrated on IEEE 33 and 69 bus radial DNs. Numerical results illustrate the validity and efficacy of the suggested method in comparison with the other existing algorithms.","PeriodicalId":153735,"journal":{"name":"2021 9th IEEE International Conference on Power Systems (ICPS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal Planning of a Distribution Network with P, PQV Buses by Jaya Algorithm\",\"authors\":\"Sumanth Pemmada, N. Patne, Ashwini D. Manchalwar, T. K. Ajay\",\"doi\":\"10.1109/ICPS52420.2021.9670411\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article performs reconfiguration of the distribution network (DN), including distributed generations (DGs) with a new set of buses P, PQV. P-bus is a reactive power support bus that maintains specific voltage at a minimum voltage bus, i.e., PQV-bus. Optimal locations of multiple DGs are determined using sensitivity factors based on reducing power loss and improvement in voltages. The capacity of reactive power support, ratings of DGs, and switching configuration are optimized by employing the recently developed Jaya algorithm. DGs accommodation is followed in sequential and non-sequential approaches. Topology constraints of reconfiguration are validated utilizing a spanning tree concept from smart graph theory. The following constraints are applied to study the problem: voltage limits at buses, current-carrying limits of lines, radial configuration, and no isolated node in the network. The proposed method's applicability is demonstrated on IEEE 33 and 69 bus radial DNs. Numerical results illustrate the validity and efficacy of the suggested method in comparison with the other existing algorithms.\",\"PeriodicalId\":153735,\"journal\":{\"name\":\"2021 9th IEEE International Conference on Power Systems (ICPS)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 9th IEEE International Conference on Power Systems (ICPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPS52420.2021.9670411\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 9th IEEE International Conference on Power Systems (ICPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPS52420.2021.9670411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文执行分配网络(DN)的重新配置,包括具有一组新的总线P、PQV的分布式代(dg)。P-bus是将特定电压维持在最小电压的无功支持总线,即pqv总线。多个dg的最佳位置是使用基于降低功率损耗和改善电压的灵敏度因子确定的。采用最新开发的Jaya算法对无功支持容量、dg额定值和开关配置进行优化。按照顺序和非顺序的方法来适应DGs。利用智能图论中的生成树概念验证了重构的拓扑约束。研究问题采用以下约束条件:母线电压限制、线路载流限制、径向配置、网络无隔离节点。在ieee33和ieee69总线径向dn上验证了该方法的适用性。数值结果表明了该方法的有效性和有效性,并与现有算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Planning of a Distribution Network with P, PQV Buses by Jaya Algorithm
This article performs reconfiguration of the distribution network (DN), including distributed generations (DGs) with a new set of buses P, PQV. P-bus is a reactive power support bus that maintains specific voltage at a minimum voltage bus, i.e., PQV-bus. Optimal locations of multiple DGs are determined using sensitivity factors based on reducing power loss and improvement in voltages. The capacity of reactive power support, ratings of DGs, and switching configuration are optimized by employing the recently developed Jaya algorithm. DGs accommodation is followed in sequential and non-sequential approaches. Topology constraints of reconfiguration are validated utilizing a spanning tree concept from smart graph theory. The following constraints are applied to study the problem: voltage limits at buses, current-carrying limits of lines, radial configuration, and no isolated node in the network. The proposed method's applicability is demonstrated on IEEE 33 and 69 bus radial DNs. Numerical results illustrate the validity and efficacy of the suggested method in comparison with the other existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信