Robust Optimal Network Reduction for Distribution Systems
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.
Authors
- Samuel C. Chevalier (ORCID: https://orcid.org/0000-0003-2426-1857)
- Mads Rønne Almassalkhi (ORCID: https://orcid.org/0000-0003-3536-5563)
- Omid Mokhtari (ORCID: https://orcid.org/0009-0001-6204-1612)
- James Bagrow
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.48550/arxiv.2611.21313
- Primary Topic
- Optimal Power Flow Distribution
- Type
- preprint