arXiv · 2611.21313
Robust Optimal Network Reduction for Distribution Systems
Abstract
Network reduction replaces large networks with smaller equivalents to speed up power flow and optimization studies. Optimal Kron-based Reduction of Networks (Opti-KRON) finds the optimal set of nodes to faithfully represent a large-scale radial network for representative loading scenarios. Under unseen nodal injections, however, its accuracy can drop. This paper extends Opti-KRON to uncertain nodal injections using robust uncertainty sets and a Wasserstein ambiguity set, with voltage magnitude error guarantees. To improve scalability, we develop a presolve screening step to eliminate redundant constraints and variables while preserving the feasible set. We also adopt adversarial constraint generation to reduce memory requirements by iteratively adding worst-case nodal injections. On a real 8,387-node feeder at a threshold of 0.001~p.u., the reduction removes 49.9% of the nodes. For one uncertainty set, adversarial constraint generation cuts the required memory by a factor of more than 18.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Omid Mokhtari, James Bagrow, Mads R. Almassalkhi, Samuel Chevalier. 2026-11-16. Robust Optimal Network Reduction for Distribution Systems. https://searcharxiv.com/abs/2611.21313
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.