输电网扩展规划的元启发式优化:能量域演化计算竞争的实验平台2

José Almeida, F. Lezama, J. Soares, Leonardo H. Macedo, Z. Vale, Rubén R. Romero
{"title":"输电网扩展规划的元启发式优化:能量域演化计算竞争的实验平台2","authors":"José Almeida, F. Lezama, J. Soares, Leonardo H. Macedo, Z. Vale, Rubén R. Romero","doi":"10.1145/3583133.3596347","DOIUrl":null,"url":null,"abstract":"The complexity of the transmission network expansion planning (TNEP) problem has been increasing due to the new constraints given by renewable generation uncertainty, new market rules and players, and the continuous demand growth with the introduction of electric vehicles and energy storage systems. The problem consists of finding the optimal number and location of new transmission lines to support the demand, which can be extremely hard to optimize. As such, in this paper, we focus on metaheuristic optimization to solve a TENP problem proposed in testbed 2 of the 2023 competition on evolutionary computation in the energy domain. The 87-bus north-northeast Brazilian transmission system is considered for the case study, and different DE metaheuristics are used for the optimization process. Results show that the HyDE algorithm presents the overall best performance when compared to other DE strategies. HyDE is able to achieve the overall lowest costs with a reduction of around 67% compared to L-SHADE.","PeriodicalId":422029,"journal":{"name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Metaheuristic Optimization for Transmission Network Expansion Planning: Testebed 2 of the Competition on Evolutionary Computation in the Energy Domain\",\"authors\":\"José Almeida, F. Lezama, J. Soares, Leonardo H. Macedo, Z. Vale, Rubén R. Romero\",\"doi\":\"10.1145/3583133.3596347\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The complexity of the transmission network expansion planning (TNEP) problem has been increasing due to the new constraints given by renewable generation uncertainty, new market rules and players, and the continuous demand growth with the introduction of electric vehicles and energy storage systems. The problem consists of finding the optimal number and location of new transmission lines to support the demand, which can be extremely hard to optimize. As such, in this paper, we focus on metaheuristic optimization to solve a TENP problem proposed in testbed 2 of the 2023 competition on evolutionary computation in the energy domain. The 87-bus north-northeast Brazilian transmission system is considered for the case study, and different DE metaheuristics are used for the optimization process. Results show that the HyDE algorithm presents the overall best performance when compared to other DE strategies. HyDE is able to achieve the overall lowest costs with a reduction of around 67% compared to L-SHADE.\",\"PeriodicalId\":422029,\"journal\":{\"name\":\"Proceedings of the Companion Conference on Genetic and Evolutionary Computation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Companion Conference on Genetic and Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3583133.3596347\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3583133.3596347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于可再生能源发电的不确定性、新的市场规则和参与者以及随着电动汽车和储能系统的引入而不断增长的需求,输电网络扩展规划(TNEP)问题的复杂性不断增加。这个问题包括找到新输电线路的最佳数量和位置来支持需求,这可能是非常难以优化的。因此,在本文中,我们将重点放在元启发式优化上,以解决2023年能源领域进化计算竞赛测试平台2中提出的TENP问题。以87总线的巴西北-东北输电系统为例,采用不同的DE元启发式方法进行优化。结果表明,与其他DE策略相比,HyDE算法具有最佳的总体性能。与L-SHADE相比,HyDE能够实现整体成本最低,降低约67%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Metaheuristic Optimization for Transmission Network Expansion Planning: Testebed 2 of the Competition on Evolutionary Computation in the Energy Domain
The complexity of the transmission network expansion planning (TNEP) problem has been increasing due to the new constraints given by renewable generation uncertainty, new market rules and players, and the continuous demand growth with the introduction of electric vehicles and energy storage systems. The problem consists of finding the optimal number and location of new transmission lines to support the demand, which can be extremely hard to optimize. As such, in this paper, we focus on metaheuristic optimization to solve a TENP problem proposed in testbed 2 of the 2023 competition on evolutionary computation in the energy domain. The 87-bus north-northeast Brazilian transmission system is considered for the case study, and different DE metaheuristics are used for the optimization process. Results show that the HyDE algorithm presents the overall best performance when compared to other DE strategies. HyDE is able to achieve the overall lowest costs with a reduction of around 67% compared to L-SHADE.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信