REVIEW 26 cited by
The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms
read the original abstract
In recent years, the power systems research community has seen an explosion of novel methods for formulating the AC power flow equations. Consequently, benchmarking studies using the seminal AC Optimal Power Flow (AC-OPF) problem have emerged as the primary method for evaluating these emerging methods. However, it is often difficult to directly compare these studies due to subtle differences in the AC-OPF problem formulation as well as the network, generation, and loading data that are used for evaluation. To help address these challenges, this IEEE PES Task Force report proposes a standardized AC-OPF mathematical formulation and the PGLib-OPF networks for benchmarking AC-OPF algorithms. A motivating study demonstrates some limitations of the established network datasets in the context of benchmarking AC-OPF algorithms and a validation study demonstrates the efficacy of using the PGLib-OPF networks for this purpose. In the interest of scientific discourse and future additions, the PGLib-OPF benchmark library is open-access and all the of network data is provided under a creative commons license.
Forward citations
Cited by 26 Pith papers
-
Power Systems Agent Benchmark: Executable Evaluation of AI Agents in Electric Power Engineering
Introduces the Power Systems Agent Benchmark with 41 task families across eight power engineering areas for executable AI agent evaluation using deterministic constraint-checking evaluators.
-
Power Systems Agent Benchmark: Executable Evaluation of AI Agents in Electric Power Engineering
Introduces the Power Systems Agent Benchmark with 41 task families across eight power engineering areas for executable evaluation of AI agents using deterministic feasibility checks.
-
Navigating the Safety-Fidelity Trade-off: Massive-Variate Time Series Forecasting for Power Systems via Probabilistic Scenarios
Introduces PowerPhase benchmark for massive-variate power-system forecasting and PowerForge model that achieves best average rank on safety-fidelity metrics across all tested grids.
-
The Limits of Quantum Computers for Power Flow
Balanced separators and corridors in transmission grids force the DC susceptance matrix condition number to grow polynomially, ruling out end-to-end quantum advantage at any readout level.
-
Scenario Reduction for Two-Stage Stochastic Mixed-Integer Programs
A new asymmetric regret cost function for scenario reduction provably picks the single best scenario and, with a hybrid pre-selection, matches its accuracy at a fraction of the compute.
-
Trust-Calibrated Certified Repair for Physics-Constrained Decisions under Localized Model Misspecification
TCR calibrates trust in constraint models via measurement-driven localization and shrinkage to deliver near-oracle feasibility on true networks under localized misspecification.
-
Multi-ResNets for Subspace Preconditioning in Constrained Optimization
MResOpt is a multi-stage ResNet architecture for constrained optimization that decomposes constraint satisfaction by priority and behaves as sequential Gaussian process regression in the infinite-width limit.
-
De-risking solutions to optimization problems
A softmax-based cutting-plane method de-risks solutions of generic optimization problems by reducing an impact metric with limited cost increase, or certifies impossibility.
-
Scalable Heterogeneous Graph Foundation Models for Data-Driven Optimal Power Flow in Smart Grids
Develops a heterogeneous GNN workflow on HydraGNN for large-scale OPF surrogate modeling across varied grid topologies and shows that pretraining improves fine-tuning on feasibility and N-1 contingency tasks.
-
Building Power Grid Models from Open Data: A Complete Pipeline from OpenStreetMap to Optimal Power Flow
A complete open-data pipeline reconstructs realistic US transmission grids from OSM and EIA sources and produces publicly released models that solve AC-OPF for 88% of single-state cases at peak load.
-
Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
Violation-based, diversity-based via k-medoids, and hybrid Benders cut filtering strategies solve more instances and cut solve times by 55-57% compared to adding all cuts.
-
Activate the Dual Cones: A Tight Reformulation of Conic ACOPF Constraints
The dual rotated second-order cone constraints of the Jabr ACOPF relaxation are always active at optimality, which lets the paper replace them with equality constraints and produce a certified lower bound.
-
Self-Certifying Primal-Dual Optimization Proxies for Large-Scale Batch Economic Dispatch
A hybrid primal-dual optimization proxy solver certifies optimality gaps via duality and achieves over 1000x speedup with a guaranteed maximum 2% gap on large-scale transmission systems.
-
Towards Generalization of Graph Neural Networks for AC Optimal Power Flow
HH-MPNN achieves under 1% optimality gap on default topologies from 14 to 2000 buses, zero-shot N-1 generalization under 3% gap, and improved size generalization via pre-training on small grids.
-
Accelerating Optimal Power Flow with GPUs: SIMD Abstraction of Nonlinear Programs and Condensed-Space Interior-Point Methods
A SIMD abstraction of nonlinear programs plus condensed-space IPM enables GPU-only ACOPF solving with roughly 10x speedup over CPU baselines in the reported benchmarks.
-
A more efficient reformulation of complex SDP as real SDP
A reformulation converts complex SDPs to real SDPs more efficiently than the conventional method and yields faster runtimes on complex polynomial optimization relaxations.
-
Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs
Sensitivity of primal-dual solutions in graph-induced NLPs decays exponentially with graph distance under SOSC and LICQ.
-
MxGPS: Multiplex Graph Transformers for a Power Grid Foundation Model
MxGPS jointly trains state-estimation and power-flow branches over a shared encoder and reports more stable zero-shot behavior on unseen grids, at the price of higher in-distribution error.
-
Scenario Reduction for Two-Stage Stochastic Mixed-Integer Programs
A new asymmetric-regret cost for mass-transport scenario reduction guarantees the best first scenario under Forward Selection and, hybridized with a cheap pre-filter, approximates full-distribution unit-commitment opt...
-
Not All Warm Starts Help: Benchmarking Primal-Dual Initializations for ACOPF Algorithms
Systematic benchmarking of all subsets of primal variables plus dual coverage for ACOPF shows only full restarts achieve reliable 47.6% median speedup; partial initializations often degrade performance.
-
Physics-Informed Graph Learning Acceleration for Large-Scale AC-OPF with Topology Changes
GraphOPF applies graph learning with physics-informed self-supervision to solve AC-OPF up to 66 times faster than baselines on large systems including the Korean grid while claiming over 99% feasibility.
-
A Feasible Reduced Space Method for Real-Time Optimal Power Flow
A novel feasible-path method solves optimal power flow in reduced space by directly enforcing power flow equations and softly penalizing operational constraints via Augmented Lagrangian, with GPU acceleration for the ...
-
Standardizing case study descriptions for multi-energy systems and networks modeling
The authors adapt an existing standard into a unified description framework for multi-energy systems case studies, apply it to diverse cases, and develop a review checklist through cross-author evaluation.
-
De-risking solutions to optimization problems
A cutting-plane methodology adjusts optimization solutions to lower risk exposure with minimal nominal cost increase or proves impossibility, borrowing from first-order optimization techniques.
-
An Efficient Hybrid Heuristic for the Transmission Expansion Planning under Uncertainty
A progressive hedging hybrid heuristic improves average solution cost by 5.28% over a strong baseline for stochastic transmission expansion planning on systems up to 10,000 nodes within a 2-hour limit.
-
Exploring the potential of ChatGPT for feedback and evaluation in experimental physics
ChatGPT is more reliable for formal structure of experimental-physics lab reports than for technical accuracy or interpretation of experimental data, so instructor oversight remains necessary.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.