A congestion-based local search for transmission expansion planning problems

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Phillipe Vilaça , Luiz Oliveira , João Saraiva
{"title":"A congestion-based local search for transmission expansion planning problems","authors":"Phillipe Vilaça ,&nbsp;Luiz Oliveira ,&nbsp;João Saraiva","doi":"10.1016/j.swevo.2023.101422","DOIUrl":null,"url":null,"abstract":"<div><p>Transmission Expansion Planning (TEP) is a challenging task that takes into consideration future representations of electricity consumption behavior and generation capacity/technology. Besides, the investment in new transmission assets is a capital-intensive task, which motivates a clear and well-justified decision-making process. As the most frequent industry practice relies on cost–benefit analysis with the evaluation of individual reinforcements, Metaheuristic Algorithms (MAs) are the most suitable techniques to evaluate candidate projects efficiently. Likewise, the intrinsic features of the problem can be incorporated into these methods taking advantage of the stochastic knowledge, to build more efficient heuristics instead of considering the solver just as a black box. In this way, this paper proposes a congestion-based local search to improve the performance of metaheuristics when solving the TEP problem. The novelty of the method lies in the utilization of the congestion level of the transmission assets to guide the search procedure. Further, this work also presents an up-to-date comparison between five MAs in solving the TEP problem. The experimental experience is conducted using the mentioned MAs in different test systems, and the results confirm that the novel approach is successful in improving the performance of the solution technique while obtaining better solutions in all test cases.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"83 ","pages":"Article 101422"},"PeriodicalIF":8.2000,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2210650223001955/pdfft?md5=52d7be4960eca5fb201f795edbc6d213&pid=1-s2.0-S2210650223001955-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650223001955","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Transmission Expansion Planning (TEP) is a challenging task that takes into consideration future representations of electricity consumption behavior and generation capacity/technology. Besides, the investment in new transmission assets is a capital-intensive task, which motivates a clear and well-justified decision-making process. As the most frequent industry practice relies on cost–benefit analysis with the evaluation of individual reinforcements, Metaheuristic Algorithms (MAs) are the most suitable techniques to evaluate candidate projects efficiently. Likewise, the intrinsic features of the problem can be incorporated into these methods taking advantage of the stochastic knowledge, to build more efficient heuristics instead of considering the solver just as a black box. In this way, this paper proposes a congestion-based local search to improve the performance of metaheuristics when solving the TEP problem. The novelty of the method lies in the utilization of the congestion level of the transmission assets to guide the search procedure. Further, this work also presents an up-to-date comparison between five MAs in solving the TEP problem. The experimental experience is conducted using the mentioned MAs in different test systems, and the results confirm that the novel approach is successful in improving the performance of the solution technique while obtaining better solutions in all test cases.

基于拥塞的局部搜索输电扩展规划问题
输电扩展规划(TEP)是一项具有挑战性的任务,需要考虑未来的电力消费行为和发电能力/技术。此外,投资新的输电资产是一项资本密集型任务,这促使一个明确和合理的决策过程。由于最常见的行业实践依赖于成本效益分析和评估单个增强,元启发式算法(MAs)是最适合有效评估候选项目的技术。同样,可以将问题的内在特征纳入这些利用随机知识的方法中,以构建更有效的启发式方法,而不是将求解器视为黑盒。因此,本文提出了一种基于拥塞的局部搜索方法,以提高元启发式算法在解决TEP问题时的性能。该方法的新颖之处在于利用传输资产的拥塞程度来指导搜索过程。此外,这项工作还提出了五个MAs在解决TEP问题方面的最新比较。在不同的测试系统中使用上述MAs进行了实验,结果证实了新方法成功地提高了求解技术的性能,同时在所有测试用例中获得了更好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信