Self Adaptive Harmony Search algorithm for Optimal Network Reconfiguration

D. Sudha Rani, N. Subrahmanyam, M. Sydulu
{"title":"Self Adaptive Harmony Search algorithm for Optimal Network Reconfiguration","authors":"D. Sudha Rani, N. Subrahmanyam, M. Sydulu","doi":"10.1109/PECI.2014.6804569","DOIUrl":null,"url":null,"abstract":"Distribution network reconfiguration is a complex combinatorial optimization process aimed at finding a radial operating structure that minimizes the system power loss, deviation of node voltages and service restoration while satisfying operating constraints. In this paper, a Self Adaptive Harmony Search algorithm (SAHSA) is proposed to solve the network reconfiguration problem in order to minimize the active and reactive power loss. SAHSA uses a stochastic search and local search instead of a gradient search. Forward and Backward Substitution Power Flow method is used to solve the radial distribution system. The proposed approach is tested on standard IEEE 33-bus and 69-bus radial distribution systems. The results are compared with Music Based Harmony Search Algorithm (MBHSA) and it is observed that the proposed method performed well in terms of the quality of solution.","PeriodicalId":352005,"journal":{"name":"2014 Power and Energy Conference at Illinois (PECI)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Power and Energy Conference at Illinois (PECI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PECI.2014.6804569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Distribution network reconfiguration is a complex combinatorial optimization process aimed at finding a radial operating structure that minimizes the system power loss, deviation of node voltages and service restoration while satisfying operating constraints. In this paper, a Self Adaptive Harmony Search algorithm (SAHSA) is proposed to solve the network reconfiguration problem in order to minimize the active and reactive power loss. SAHSA uses a stochastic search and local search instead of a gradient search. Forward and Backward Substitution Power Flow method is used to solve the radial distribution system. The proposed approach is tested on standard IEEE 33-bus and 69-bus radial distribution systems. The results are compared with Music Based Harmony Search Algorithm (MBHSA) and it is observed that the proposed method performed well in terms of the quality of solution.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最优网络重构的自适应和谐搜索算法
配电网重构是一个复杂的组合优化过程,其目标是在满足运行约束的前提下,寻找一种使系统功率损耗、节点电压偏差和业务恢复最小化的径向运行结构。本文提出了一种自适应和谐搜索算法(SAHSA)来解决电网重构问题,使有功和无功损耗最小。SAHSA使用随机搜索和局部搜索代替梯度搜索。采用正向和反向替代潮流法求解径向配电系统。该方法在标准的IEEE 33总线和69总线径向配电系统上进行了测试。将结果与基于音乐的和声搜索算法(Music Based Harmony Search Algorithm, MBHSA)进行了比较,结果表明所提方法在解的质量方面表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reliable GPS-based timing for power systems: A multi-layered multi-receiver architecture Estimation of state variable statistics in the presence of intermittent energy resources Microgrid frequency regulation using wind turbine controls Improving performance of the non-iterative direct state estimation method Smart-grid-enabled distributed reactive power support with Conservation Voltage Reduction
×
引用
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