基于 GNN 的收集系统成本代用模型

M. Souza De Alencar, T. Göçmen, N. Cutululis
{"title":"基于 GNN 的收集系统成本代用模型","authors":"M. Souza De Alencar, T. Göçmen, N. Cutululis","doi":"10.1088/1742-6596/2767/8/082018","DOIUrl":null,"url":null,"abstract":"There are no known polynomial-time algorithms to perform the cable layout optimization (CLO) for the electrical network within a wind power plant (WPP). This means the computational cost for solving the CLO problem grows exponentially with plant size, which often postpones its solution to until after most design decisions are made, thus forgoing some trade-offs that would be beneficial to the plant’s goal. This work presents a method to obtain a fast estimate of the CLO that can be performed at each iteration of the broader optimization framework. The proposed surrogate model comprises of a graph neural network (GNN) regression model, as this architecture resembles the graph nature of the CLO problem. The GNN is trained with a dataset of procedurally generated site instances that are optimized by costly solving an integer linear programming model. While the inference time for GNNs is constant, the features calculation proposed has time complexity O(N log N) (where N is the number of wind turbines). This still means a major speed up for problems of non-trivial size when compared to exact CLO. A simpler feed-forward neural network (FNN) was trained on the same dataset and used as baseline. Both GNN and FNN achieved r 2 scores of 0.997 for the regression on unseen data of actual WPP, with standard deviations of the relative errors of 1.59% for the FNN and 1.66% for the GNN. Although the GNN did not improve on the performance of the FNN, the latter is an original contribution to the state of the art and an useful tool for the integrated optimization of WPP. This work looked only into a sliver of what is possible with GNNs, leaving ample space for improvements in applying that architecture to the CLO problem.","PeriodicalId":16821,"journal":{"name":"Journal of Physics: Conference Series","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GNN-based surrogate modeling for collection systems costs\",\"authors\":\"M. Souza De Alencar, T. Göçmen, N. Cutululis\",\"doi\":\"10.1088/1742-6596/2767/8/082018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are no known polynomial-time algorithms to perform the cable layout optimization (CLO) for the electrical network within a wind power plant (WPP). This means the computational cost for solving the CLO problem grows exponentially with plant size, which often postpones its solution to until after most design decisions are made, thus forgoing some trade-offs that would be beneficial to the plant’s goal. This work presents a method to obtain a fast estimate of the CLO that can be performed at each iteration of the broader optimization framework. The proposed surrogate model comprises of a graph neural network (GNN) regression model, as this architecture resembles the graph nature of the CLO problem. The GNN is trained with a dataset of procedurally generated site instances that are optimized by costly solving an integer linear programming model. While the inference time for GNNs is constant, the features calculation proposed has time complexity O(N log N) (where N is the number of wind turbines). This still means a major speed up for problems of non-trivial size when compared to exact CLO. A simpler feed-forward neural network (FNN) was trained on the same dataset and used as baseline. Both GNN and FNN achieved r 2 scores of 0.997 for the regression on unseen data of actual WPP, with standard deviations of the relative errors of 1.59% for the FNN and 1.66% for the GNN. Although the GNN did not improve on the performance of the FNN, the latter is an original contribution to the state of the art and an useful tool for the integrated optimization of WPP. This work looked only into a sliver of what is possible with GNNs, leaving ample space for improvements in applying that architecture to the CLO problem.\",\"PeriodicalId\":16821,\"journal\":{\"name\":\"Journal of Physics: Conference Series\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Physics: Conference Series\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1088/1742-6596/2767/8/082018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics: Conference Series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/1742-6596/2767/8/082018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

目前还没有已知的多项式时间算法来对风力发电厂(WPP)内的电网进行电缆布局优化(CLO)。这意味着求解 CLO 问题的计算成本会随着电厂规模的扩大而呈指数增长,这往往会将求解时间推迟到大多数设计决策做出之后,从而放弃了一些对电厂目标有利的权衡。这项工作提出了一种快速估算 CLO 的方法,可以在更广泛的优化框架的每次迭代中执行。所提出的代用模型由图神经网络(GNN)回归模型组成,因为这种结构类似于 CLO 问题的图性质。GNN 使用程序生成的站点实例数据集进行训练,该数据集通过对整数线性规划模型进行成本求解来优化。虽然 GNN 的推理时间是恒定的,但所提出的特征计算的时间复杂度为 O(N log N)(其中 N 是风力涡轮机的数量)。与精确的 CLO 相比,这仍然意味着对于非微小问题的处理速度大大加快。在同一数据集上还训练了一个更简单的前馈神经网络 (FNN),并将其作为基线。GNN 和 FNN 对实际 WPP 未见数据的回归结果 r 2 均达到 0.997,FNN 和 GNN 的相对误差标准偏差分别为 1.59% 和 1.66%。虽然 GNN 没有提高 FNN 的性能,但后者是对最新技术的原创性贡献,也是 WPP 综合优化的有用工具。这项工作只研究了 GNN 的一小部分功能,在将该架构应用于 CLO 问题时,还有很大的改进空间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GNN-based surrogate modeling for collection systems costs
There are no known polynomial-time algorithms to perform the cable layout optimization (CLO) for the electrical network within a wind power plant (WPP). This means the computational cost for solving the CLO problem grows exponentially with plant size, which often postpones its solution to until after most design decisions are made, thus forgoing some trade-offs that would be beneficial to the plant’s goal. This work presents a method to obtain a fast estimate of the CLO that can be performed at each iteration of the broader optimization framework. The proposed surrogate model comprises of a graph neural network (GNN) regression model, as this architecture resembles the graph nature of the CLO problem. The GNN is trained with a dataset of procedurally generated site instances that are optimized by costly solving an integer linear programming model. While the inference time for GNNs is constant, the features calculation proposed has time complexity O(N log N) (where N is the number of wind turbines). This still means a major speed up for problems of non-trivial size when compared to exact CLO. A simpler feed-forward neural network (FNN) was trained on the same dataset and used as baseline. Both GNN and FNN achieved r 2 scores of 0.997 for the regression on unseen data of actual WPP, with standard deviations of the relative errors of 1.59% for the FNN and 1.66% for the GNN. Although the GNN did not improve on the performance of the FNN, the latter is an original contribution to the state of the art and an useful tool for the integrated optimization of WPP. This work looked only into a sliver of what is possible with GNNs, leaving ample space for improvements in applying that architecture to the CLO problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.20
自引率
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学术官方微信