Heterogeneous Graph Neural Network with Local and Global Message Passing for AC-Optimal Power Flow Solutions

The AC Optimal Power Flow (AC-OPF) problem remains a major computational bottleneck for real-time power system operation. Conventional solvers are accurate but time-consuming, while Graph Neural Networks (GNNs) offer faster approximations yet struggle to capture long-range dependencies and handle topological variations. To address these limitations, we propose a Heterogeneous Graph Transformer with bus-centric Local–Global Message Passing (LG-HGNN). The model performs type-specific local message passing over heterogeneous power graphs and applies a global Transformer only on bus nodes to capture system-wide correlations efficiently. Effective-resistance positional encodings and resistance-biased attention enhance electrical awareness, whereas bounded decoders and physics-informed regularization preserve operational feasibility. Experiments on IEEE 14-, 30-, and 118-bus systems show that LG-HGNN achieves near-optimal results within a few percent of the AC-OPF optimum and generalizes to thousands of unseen N-1 contingency topologies without retraining. Compared with interior-point solvers, it attains up to 190× speedup before power-flow correction and over 10× afterward on GOC 2000-bus systems, providing a scalable and physically consistent surrogate for real-time AC-OPF.

Authors

Institutions

Publication Details

Journal
Applied System Innovation
Published
2026-01-05
DOI
https://doi.org/10.3390/asi9010018
Primary Topic
Optimal Power Flow Distribution
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Heterogeneous Graph Neural Network with Local and Global Message Passing for AC-Optimal Power Flow Solutions

Bao Wen, Aihui Wen, Jin Xu, Jining Li
Applied System Innovation
Optimal Power Flow Distribution
article

Heterogeneous Graph Neural Network with Local and Global Message Passing for AC-Optimal Power Flow Solutions

Bao Wen, Aihui Wen, Jin Xu, Jining Li
article en

Abstract

The AC Optimal Power Flow (AC-OPF) problem remains a major computational bottleneck for real-time power system operation. Conventional solvers are accurate but time-consuming, while Graph Neural Networks (GNNs) offer faster approximations yet struggle to capture long-range dependencies and handle topological variations. To address these limitations, we propose a Heterogeneous Graph Transformer with bus-centric Local–Global Message Passing (LG-HGNN). The model performs type-specific local message passing over heterogeneous power graphs and applies a global Transformer only on bus nodes to capture system-wide correlations efficiently. Effective-resistance positional encodings and resistance-biased attention enhance electrical awareness, whereas bounded decoders and physics-informed regularization preserve operational feasibility. Experiments on IEEE 14-, 30-, and 118-bus systems show that LG-HGNN achieves near-optimal results within a few percent of the AC-OPF optimum and generalizes to thousands of unseen N-1 contingency topologies without retraining. Compared with interior-point solvers, it attains up to 190× speedup before power-flow correction and over 10× afterward on GOC 2000-bus systems, providing a scalable and physically consistent surrogate for real-time AC-OPF.

Applied System InnovationVol. 9(1)
China Southern Power Grid (China) (CN), Power Grid Corporation (India) (IN), South China University of Technology (CN)
Strong
Openalex Percentile: Top 97%
Optimal Power Flow Distribution
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.