Transmission expansion planning: A deep learning approach

IF 4.8 2区 工程技术 Q2 ENERGY & FUELS Sustainable Energy Grids & Networks Pub Date : 2024-12-20 DOI:10.1016/j.segan.2024.101585
Jizhe Dong , Jianshe Cao , Yu Lu , Yuexin Zhang , Jiulong Li , Chongshan Xu , Danchen Zheng , Shunjie Han
{"title":"Transmission expansion planning: A deep learning approach","authors":"Jizhe Dong ,&nbsp;Jianshe Cao ,&nbsp;Yu Lu ,&nbsp;Yuexin Zhang ,&nbsp;Jiulong Li ,&nbsp;Chongshan Xu ,&nbsp;Danchen Zheng ,&nbsp;Shunjie Han","doi":"10.1016/j.segan.2024.101585","DOIUrl":null,"url":null,"abstract":"<div><div>This paper proposes a transmission expansion planning (TEP) method based on deep learning (DL) to address the increasing complexity and excessive reliance on mathematical formulas in current TEP models. First, we utilize a traditional mathematical programming model to obtain unit outputs and line construction decisions by varying loads, thereby generating the dataset required for DL training. Next, we build a convolutional neural network (CNN) based DL model, which includes convolutional layers, pooling layers and fully connected layers, and whose inputs consist of load data and unit output data, while output is line construction data. We use Bayesian optimization (BO) to select the best hyperparameters for the model. We conducted both single and multiple training experiments on the Garver’s 6-bus, IEEE 24-bus and IEEE 118-bus systems. In the single training experiments, the R<sup>2</sup> values achieved by our proposed method on these three systems were 0.99471, 0.99594 and 0.99676, respectively, with K-fold cross-validation showing stable results. In the multiple training experiments, we repeated the CNN training 50 times and obtained confidence intervals for each metric to further validate the model’s effectiveness. Additionally, we performed significance testing on the BO results, showing that among the three comparative experiments, two had P-values less than 0.001, indicating a significant difference. The remaining one has a P-value is larger than 0.05 indicating a difference but not significant.</div></div>","PeriodicalId":56142,"journal":{"name":"Sustainable Energy Grids & Networks","volume":"41 ","pages":"Article 101585"},"PeriodicalIF":4.8000,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sustainable Energy Grids & Networks","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352467724003151","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENERGY & FUELS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a transmission expansion planning (TEP) method based on deep learning (DL) to address the increasing complexity and excessive reliance on mathematical formulas in current TEP models. First, we utilize a traditional mathematical programming model to obtain unit outputs and line construction decisions by varying loads, thereby generating the dataset required for DL training. Next, we build a convolutional neural network (CNN) based DL model, which includes convolutional layers, pooling layers and fully connected layers, and whose inputs consist of load data and unit output data, while output is line construction data. We use Bayesian optimization (BO) to select the best hyperparameters for the model. We conducted both single and multiple training experiments on the Garver’s 6-bus, IEEE 24-bus and IEEE 118-bus systems. In the single training experiments, the R2 values achieved by our proposed method on these three systems were 0.99471, 0.99594 and 0.99676, respectively, with K-fold cross-validation showing stable results. In the multiple training experiments, we repeated the CNN training 50 times and obtained confidence intervals for each metric to further validate the model’s effectiveness. Additionally, we performed significance testing on the BO results, showing that among the three comparative experiments, two had P-values less than 0.001, indicating a significant difference. The remaining one has a P-value is larger than 0.05 indicating a difference but not significant.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Sustainable Energy Grids & Networks
Sustainable Energy Grids & Networks Energy-Energy Engineering and Power Technology
CiteScore
7.90
自引率
13.00%
发文量
206
审稿时长
49 days
期刊介绍: Sustainable Energy, Grids and Networks (SEGAN)is an international peer-reviewed publication for theoretical and applied research dealing with energy, information grids and power networks, including smart grids from super to micro grid scales. SEGAN welcomes papers describing fundamental advances in mathematical, statistical or computational methods with application to power and energy systems, as well as papers on applications, computation and modeling in the areas of electrical and energy systems with coupled information and communication technologies.
期刊最新文献
Fast and accurate simulation of smart digital controllers in power system dynamic studies Quantifying the demand response potential of heat pumps and electric vehicles considering communication protocol constraints A revenue-adequate market design for Grid-enhancing technologies Heat and power energy management of VPP with renewable sources and plug-in electric vehicle in energy and reserve market Impact of thermal stores on multi-energy microgrids with multi-layer dynamic control architecture
×
引用
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