基于混合蚁群搜索的配电网络重构降损算法

T. Khoa, P. Binh
{"title":"基于混合蚁群搜索的配电网络重构降损算法","authors":"T. Khoa, P. Binh","doi":"10.1109/TDCLA.2006.311584","DOIUrl":null,"url":null,"abstract":"This paper presents one of applications of the ant colony search method to reduce the minimum losses of distribution network. The configuration of distribution network is defined by the tie switches and sectionalized switches. The configuration optimization problem of distribution network is a combination optimization with a large search space involved the operational constraints of the distribution. An ant colony search (ACS) and a hybrid ACS combining membership functions are proposed to achieve both the global optimization and the fastest computing time. The results are compared to the ones obtained from other heuristic methods (heuristic, simulated annealing, genetic). All of the algorithms are programmed on Matlab applied to the typical distribution system 3 feeders, 17 buses, 16 switches and one feeder of Hochiminh Utility, 55 buses, 13 switches. This ant colony search algorithms obtains computation time faster and more reliability than other ones","PeriodicalId":406067,"journal":{"name":"2006 IEEE/PES Transmission & Distribution Conference and Exposition: Latin America","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A Hybrid Ant Colony Search Based Reconfiguration of Distribution Network for Loss Reduction\",\"authors\":\"T. Khoa, P. Binh\",\"doi\":\"10.1109/TDCLA.2006.311584\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents one of applications of the ant colony search method to reduce the minimum losses of distribution network. The configuration of distribution network is defined by the tie switches and sectionalized switches. The configuration optimization problem of distribution network is a combination optimization with a large search space involved the operational constraints of the distribution. An ant colony search (ACS) and a hybrid ACS combining membership functions are proposed to achieve both the global optimization and the fastest computing time. The results are compared to the ones obtained from other heuristic methods (heuristic, simulated annealing, genetic). All of the algorithms are programmed on Matlab applied to the typical distribution system 3 feeders, 17 buses, 16 switches and one feeder of Hochiminh Utility, 55 buses, 13 switches. This ant colony search algorithms obtains computation time faster and more reliability than other ones\",\"PeriodicalId\":406067,\"journal\":{\"name\":\"2006 IEEE/PES Transmission & Distribution Conference and Exposition: Latin America\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE/PES Transmission & Distribution Conference and Exposition: Latin America\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TDCLA.2006.311584\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE/PES Transmission & Distribution Conference and Exposition: Latin America","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TDCLA.2006.311584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

本文介绍了蚁群搜索方法在降低配电网最小损耗中的应用。配电网的配置由tie交换机和分段交换机定义。配电网配置优化问题是一个涉及配电网运行约束的大搜索空间组合优化问题。提出了蚁群搜索(ACS)和结合隶属函数的混合ACS,以实现全局优化和最快的计算时间。结果与其他启发式方法(启发式、模拟退火、遗传)的结果进行了比较。所有算法都在Matlab上编程,并应用于胡志明市公用事业公司的典型配电系统3条馈线,17条母线,16条交换机和1条馈线,55条母线,13条交换机。该蚁群搜索算法计算速度快,可靠性高
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Hybrid Ant Colony Search Based Reconfiguration of Distribution Network for Loss Reduction
This paper presents one of applications of the ant colony search method to reduce the minimum losses of distribution network. The configuration of distribution network is defined by the tie switches and sectionalized switches. The configuration optimization problem of distribution network is a combination optimization with a large search space involved the operational constraints of the distribution. An ant colony search (ACS) and a hybrid ACS combining membership functions are proposed to achieve both the global optimization and the fastest computing time. The results are compared to the ones obtained from other heuristic methods (heuristic, simulated annealing, genetic). All of the algorithms are programmed on Matlab applied to the typical distribution system 3 feeders, 17 buses, 16 switches and one feeder of Hochiminh Utility, 55 buses, 13 switches. This ant colony search algorithms obtains computation time faster and more reliability than other ones
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信