A Boundary-Compensated Partition-Based Parallel Graph Neural Network for Weak-Bus Identification in Interconnected Power Grids

Weak-bus identification is a key task for online security assessment, preventive control, maintenance verification, and resilience-oriented dispatch of interconnected power grids. In large-scale grids, conventional full-graph graph neural networks preserve the complete network topology but may become inefficient when many operating scenarios must be screened repeatedly. Direct graph partitioning improves computational tractability, but it may cut tie-line channels and weaken the boundary evidence that determines cross-area risk propagation. To address this trade-off, this paper proposes a boundary-compensated partition-based parallel graph neural network for weak-bus identification. The method first constructs a scenario-aware weighted power-grid graph and divides it into electrically coherent subgraphs under coupling-strength and partition-size constraints. Local graph encoders are then executed in parallel to learn intra-partition vulnerability representations. A boundary compensation module further restores cross-partition information by weighting tie-line neighbors according to electrical coupling, branch loading, and cross-area association. Standardized partition scores are finally fused into a whole-grid weak-bus ranking, and a composite learning objective jointly considers node-score regression, boundary consistency, and pairwise ranking stability. The method is evaluated on the IEEE 57-bus benchmark with mechanism-based node and branch vulnerability labels. Compared with the original full-graph GNN, the proposed method reduces the mean square error from 0.0359 to 0.0147, improves the Spearman rank coefficient from 0.248 to 0.446, and increases Hit@10 from 30% to 70%. Topological interpretation further shows that the identified weak buses are concentrated around high-risk branches such as 8-12, 12-14, 0-14, and 7-8, indicating that the proposed framework captures local aggregation, boundary transmission, and corridor-driven vulnerability propagation. The IEEE 57-bus benchmark is used as a focused validation case because it provides aligned node- and branch-level vulnerability evidence for evaluating weak-bus ranking behavior. Because the available aligned vulnerability evidence is concentrated in this medium-scale benchmark, the results should be interpreted as a focused validation of the proposed ranking mechanism rather than as a complete large-system scalability study.

Authors

Institutions

Publication Details

Journal
Energies
Published
2026-05-29
DOI
https://doi.org/10.3390/en19112630
Primary Topic
Power System Optimization and Stability
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

A Boundary-Compensated Partition-Based Parallel Graph Neural Network for Weak-Bus Identification in Interconnected Power Grids

Yuan Si, Jishuo Qin, Zhe Zhang, Lining Su et al.
Energies
Power System Optimization and Stability
article

A Boundary-Compensated Partition-Based Parallel Graph Neural Network for Weak-Bus Identification in Interconnected Power Grids

Yuan Si, Jishuo Qin, Zhe Zhang, Lining Su, Yawei Xue, Fan Li
article en

Abstract

Weak-bus identification is a key task for online security assessment, preventive control, maintenance verification, and resilience-oriented dispatch of interconnected power grids. In large-scale grids, conventional full-graph graph neural networks preserve the complete network topology but may become inefficient when many operating scenarios must be screened repeatedly. Direct graph partitioning improves computational tractability, but it may cut tie-line channels and weaken the boundary evidence that determines cross-area risk propagation. To address this trade-off, this paper proposes a boundary-compensated partition-based parallel graph neural network for weak-bus identification. The method first constructs a scenario-aware weighted power-grid graph and divides it into electrically coherent subgraphs under coupling-strength and partition-size constraints. Local graph encoders are then executed in parallel to learn intra-partition vulnerability representations. A boundary compensation module further restores cross-partition information by weighting tie-line neighbors according to electrical coupling, branch loading, and cross-area association. Standardized partition scores are finally fused into a whole-grid weak-bus ranking, and a composite learning objective jointly considers node-score regression, boundary consistency, and pairwise ranking stability. The method is evaluated on the IEEE 57-bus benchmark with mechanism-based node and branch vulnerability labels. Compared with the original full-graph GNN, the proposed method reduces the mean square error from 0.0359 to 0.0147, improves the Spearman rank coefficient from 0.248 to 0.446, and increases Hit@10 from 30% to 70%. Topological interpretation further shows that the identified weak buses are concentrated around high-risk branches such as 8-12, 12-14, 0-14, and 7-8, indicating that the proposed framework captures local aggregation, boundary transmission, and corridor-driven vulnerability propagation. The IEEE 57-bus benchmark is used as a focused validation case because it provides aligned node- and branch-level vulnerability evidence for evaluating weak-bus ranking behavior. Because the available aligned vulnerability evidence is concentrated in this medium-scale benchmark, the results should be interpreted as a focused validation of the proposed ranking mechanism rather than as a complete large-system scalability study.

EnergiesVol. 19(11)
North China Electric Power University (CN), China Power Engineering Consulting Group (China) (CN), Xi'an Jiaotong University (CN)
State Grid Corporation of China
Openalex Percentile: Top 9%
Power System Optimization and Stability
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.