ORIGINAL RESEARCH article
Front. Energy Res.
Sec. Smart Grids
This article is part of the Research TopicNew Advances in Learning-assisted Diagnosis and Control of Electric Distribution NetworksView all articles
Dynamic Reconfiguration of Large-Scale Distribution Networks Using GNN-Guided B&B
Provisionally accepted
- 1State Grid Zhejiang Electric Power Co, Hangzhou, China
- 2Shanghai University of Electric Power, Shanghai, China
- 3State Grid Zhejiang Electric Power Co., Ltd., Hangzhou, China
Select one of your emails
You have multiple emails registered with Frontiers:
Notify me on publication
Please enter your email address:
If you already have an account, please login
You don't have a Frontiers account ? You can register here
The high penetration of renewable energy sources has posed significant operational challenges to modern distribution networks. Dynamic network reconfiguration, as a critical optimization technique, plays a vital role in reducing power losses and enhancing system flexibility. However, the dynamic distribution network reconfiguration (DNR) problem is often formulated as a large-scale Mixed-Integer Second-Order Cone Programming (MISOCP) model, where conventional branch-and-bound (B&B) algorithms suffer from the curse of dimensionality and typically fail to converge within the limited time window required for real-time decision-making. To address this issue, this paper proposes a graph neural network (GNN)-guided branch-and-bound approach. First, a high-quality training dataset is constructed by collecting optimal branching decisions made by expert-level solvers across a large number of reconfiguration instances. Then, a GNN model is designed and trained to accurately predict the most promising branching variable under arbitrary network conditions. Finally, the trained GNN is integrated into the B&B framework to guide the branching process with learned decision policies, effectively pruning the search tree and accelerating convergence. Comprehensive case studies on IEEE standard test systems demonstrate the superior performance of our approach, achieving on the 1354-bus system a 60.1% reduction in solving time, a 59.5% reduction in optimality gap, and a 0.39% reduction in operational cost. On the larger 2383-bus system, the improvements are even more substantial, with a 65.0% reduction in solving time, a 47.6% reduction in optimality gap, and a 0.65% reduction in operational cost compared to the standard SCIP solver.
Keywords: dynamic network reconfiguration, Graph neural network, branch-and-bound, Mixed-integer second-order cone programming, Distribution network
Received: 25 Sep 2025; Accepted: 18 Nov 2025.
Copyright: © 2025 Wu, Zhang, Hong, Zheng, Zhou, Gao and Zheng. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
* Correspondence: Bingyang Gao, bingyang@mail.shiep.edu.cn
Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.