基于图神经网络的简化最优潮流
Reduced Optimal Power Flow Using Graph Neural Network
AI总结:
本文提出用图神经网络预测关键线路,构建简化最优潮流(ROPF)问题,在保持解质量的同时显著降低计算时间。
摘要:
最优潮流(OPF)问题在电力系统运行中被提出并求解,尤其是在实时确定发电调度点方面。对于具有大量变量和约束的大型复杂电力系统网络,及时找到实时OPF的最优解需要巨大的计算能力。本文提出了一种利用图神经网络(GNN)减少原始OPF问题中约束数量的新方法。GNN是一种创新的机器学习模型,利用节点、边和网络拓扑的特征来最大化其性能。本文中,我们提出了一个GNN模型来预测在给定负荷分布和发电容量下哪些线路会重载或拥堵。只有这些关键线路将在OPF问题中被监测,从而形成一个简化OPF(ROPF)问题。所提出的ROPF模型预计将显著节省计算时间。本文还对GNN模型的预测进行了全面分析。结论是,将GNN应用于ROPF能够在保持解质量的同时减少计算时间。
英文摘要:
OPF problems are formulated and solved for power system operations, especially for determining generation dispatch points in real-time. For large and complex power system networks with large numbers of variables and constraints, finding the optimal solution for real-time OPF in a timely manner requires a massive amount of computing power. This paper presents a new method to reduce the number of constraints in the original OPF problem using a graph neural network (GNN). GNN is an innovative machine learning model that utilizes features from nodes, edges, and network topology to maximize its performance. In this paper, we proposed a GNN model to predict which lines would be heavily loaded or congested with given load profiles and generation capacities. Only these critical lines will be monitored in an OPF problem, creating a reduced OPF (ROPF) problem. Significant saving in computing time is expected from the proposed ROPF model. A comprehensive analysis of predictions from the GNN model was also made. It is concluded that the application of GNN for ROPF is able to reduce computing time while retaining solution quality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。