An efficient algorithm for network reconfiguration in distribution system

Y. Jeon, Jae-Chul Kim
{"title":"An efficient algorithm for network reconfiguration in distribution system","authors":"Y. Jeon, Jae-Chul Kim","doi":"10.1109/TENCON.1999.818566","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient algorithm for loss reduction of distribution system by sectionalizing switch operation in the distribution system. Simulated annealing can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of simulated annealing, we may use modified simulated annealing. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approach results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.1999.818566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

This paper presents an efficient algorithm for loss reduction of distribution system by sectionalizing switch operation in the distribution system. Simulated annealing can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of simulated annealing, we may use modified simulated annealing. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approach results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.
配电网重构的一种有效算法
提出了一种有效的配电系统减损算法,将配电系统中的开关操作分段化。模拟退火可以通过接受成本的改进来避免逃避局部最小值,但这种算法的使用也造成了过多的计算时间需求。为了克服模拟退火的这一主要限制,我们可以使用改进的模拟退火。在搜索过程中,采用基于统计计算的多项式时间冷却方案。这种方法可以节省CPU时间。数值算例验证了所提方法的正确性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信