Distribution network reconfiguration using genetic algorithm and load flow

P. L. Roux, J. Munda, Y. Hamam
{"title":"Distribution network reconfiguration using genetic algorithm and load flow","authors":"P. L. Roux, J. Munda, Y. Hamam","doi":"10.1109/ASSCC.2012.6523339","DOIUrl":null,"url":null,"abstract":"There are various ways of reducing active power losses in distribution networks. Network reconfiguration is one of the most important methods. However, it can be a very difficult optimisation problem. The proposed Genetic Algorithm with Rank Weight selection is used to search the population for the optimum solution in the network. The chromosome is represented by a string of binary numbers (zeroes, 0s and ones, 1s). By opening one switch in each loop (fundamental loop approach), almost all the solutions will be feasible (radial networks). By doing this the chromosome will only consist of the open switches (Genotype); thus reducing the computation time. Constraints are used to filter the search by means of penalty factors, which guarantees the solution found by the Genetic Algorithm to be feasible.","PeriodicalId":341348,"journal":{"name":"2012 10th International Power & Energy Conference (IPEC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 10th International Power & Energy Conference (IPEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASSCC.2012.6523339","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

There are various ways of reducing active power losses in distribution networks. Network reconfiguration is one of the most important methods. However, it can be a very difficult optimisation problem. The proposed Genetic Algorithm with Rank Weight selection is used to search the population for the optimum solution in the network. The chromosome is represented by a string of binary numbers (zeroes, 0s and ones, 1s). By opening one switch in each loop (fundamental loop approach), almost all the solutions will be feasible (radial networks). By doing this the chromosome will only consist of the open switches (Genotype); thus reducing the computation time. Constraints are used to filter the search by means of penalty factors, which guarantees the solution found by the Genetic Algorithm to be feasible.
基于遗传算法和潮流的配电网重构
降低配电网有功损耗的方法多种多样。网络重构是其中最重要的方法之一。然而,这可能是一个非常困难的优化问题。提出了一种带秩权选择的遗传算法,用于搜索网络中最优解的种群。染色体由一串二进制数字(0 0和1 15)表示。通过在每个环路中打开一个开关(基本环路方法),几乎所有的解决方案都是可行的(径向网络)。这样,染色体将只由打开的开关组成(基因型);从而减少了计算时间。利用约束条件通过惩罚因子对搜索结果进行过滤,保证了遗传算法的解是可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信