Network reconfiguration for loss reduction using Plant Growth Simulation Algorithm

P. R. Rao, S. Sivanagaraju, P. Prasad
{"title":"Network reconfiguration for loss reduction using Plant Growth Simulation Algorithm","authors":"P. R. Rao, S. Sivanagaraju, P. Prasad","doi":"10.1109/ICPCES.2010.5698688","DOIUrl":null,"url":null,"abstract":"This paper presents Plant Growth Simulation Algorithm (PGSA) for minimum loss configuration of radial distribution network. The algorithm has emerged as a useful optimization tool for handling nonlinear programming problems. The algorithm implements a guiding search direction that changes dynamically as the change of the objective function and does not require any external parameters. The objective in this network reconfiguration problem is to minimize the total real power loss in the distribution system in order to reduce the cost of supplying the electrical power demanded by the loads. The proposed method handles objective function and constraints separately, which averts the trouble to determine the barrier factors. The effectiveness of the proposed method is illustrated through an examples consisting of 16-node radial distribution network for loss minimization.","PeriodicalId":439893,"journal":{"name":"2010 International Conference on Power, Control and Embedded Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Power, Control and Embedded Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPCES.2010.5698688","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

This paper presents Plant Growth Simulation Algorithm (PGSA) for minimum loss configuration of radial distribution network. The algorithm has emerged as a useful optimization tool for handling nonlinear programming problems. The algorithm implements a guiding search direction that changes dynamically as the change of the objective function and does not require any external parameters. The objective in this network reconfiguration problem is to minimize the total real power loss in the distribution system in order to reduce the cost of supplying the electrical power demanded by the loads. The proposed method handles objective function and constraints separately, which averts the trouble to determine the barrier factors. The effectiveness of the proposed method is illustrated through an examples consisting of 16-node radial distribution network for loss minimization.
利用植物生长模拟算法进行网络重构以减少损失
针对径向配电网的最小损耗配置,提出了植物生长模拟算法(PGSA)。该算法已成为处理非线性规划问题的一种有用的优化工具。该算法实现了一个随着目标函数的变化而动态变化的引导搜索方向,不需要任何外部参数。该网络重构问题的目标是使配电系统的总实际功率损耗最小,以降低为负荷提供所需电力的成本。该方法将目标函数和约束条件分开处理,避免了确定障碍因子的麻烦。通过一个16节点径向配电网的实例验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信