GridSFM is a 15‑million‑parameter physics‑inspired graph neural network that serves as a foundation model for solving AC Optimal Power Flow (AC‑OPF) across diverse grid topologies. Pretrained on 54 topologies ranging from 500 to 4,000 buses, it achieves a 2.45 % zero‑shot generation‑cost error on a held‑out 10,000‑bus case and adapts to unseen grids with only 100 solved instances using a physics‑informed fine‑tuning scheme based on Newton’s method. The authors address the disconnected feasible set of AC‑OPF by lifting and relaxing constraints with logarithmically penalized slacks, proving the resulting elastic feasible set is contractible and that solutions can be projected back onto the original feasible set.
By Luke Bhan, Weiwei Yang, Margaret Capetz, Baosen Zhang
The paper introduces Penalty + Sequential Linearized Feasibility Seeking (SLFS), a self‑supervised learning framework for solving multiphase AC optimal power flow (AC‑OPF) in distribution systems with topology reconfiguration. SLFS trains directly from the AC‑OPF objective and constraints using a differentiable fixed‑point power flow solver, avoiding the need for labeled optimal solutions. It achieves negligible optimality gaps and near‑zero constraint violations on IEEE feeders up to 8,500 nodes, delivering up to three orders of magnitude speedups over IPOPT while maintaining robustness to large distributional shifts.
By Hoang T. Nguyen, Shaohui Liu, Reetam Sen Biswas, Varsha Pendyala, Nurali Virani, Deepjyoti Deka, Priya L. Donti
arXiv:2410. 04818v2 Announce Type: replace-cross Abstract: We present PINCO, an unsupervised learning framework that integrates Graph Neural Networks with physics-informed neural networks for AC optimal power flow (AC-OPF) solutions.
By Anna Varbella, Damien Briens, Blazhe Gjorgiev, Giuseppe Alessio D'Inverno, Priya L. Donti, Giovanni Sansavini
arXiv:2511. 13592v2 Announce Type: replace-cross Abstract: The existing method of GS-PowerOpt solves the non-convex optimization problem of the form $\max_{\boldsymbol{x} \in \mathbb{R}^d} f(\boldsymbol{x})$ through maximizing a Gaussian-smoothed surrogate $F_{N,\sigma}(\boldsymbol{\mu}) = \mathbb{E}_{\boldsymbol{x}\sim\mathcal{N}(\boldsymbol{\mu},\sigma^2 I_d)}[e^{N f(\boldsymbol{x})}]$.
By Chen Xu
arXiv:2608. 09707v1 Announce Type: cross Abstract: Embedding trained neural networks as surrogates within optimisation problems is an established practice in operations research.
By Yu Liu, Jan Kronqvist, Fabricio Oliveira
arXiv:2508. 20330v5 Announce Type: replace Abstract: Combinatorial optimization problems are ubiquitous in science and engineering.
By Zohair Shafi, Serdar Kadioglu