Towards Optimal Kron-based Reduction Of Networks (Opti-KRON) for the Electric Power Grid
Samuel Chevalier, Mads R. Almassalkhi

TL;DR
This paper introduces an optimal Kron-based network reduction method for large-scale power grids, balancing reduction degree and accuracy using MILP and graph Laplacian constraints, enabling fast and precise modeling.
Contribution
It presents a novel MILP-based Kron reduction technique that optimally reduces power networks while maintaining physical accuracy, suitable for large-scale systems.
Findings
Achieves 25-85% network reduction within seconds
Maintains voltage deviation errors below 0.01pu
Effective for medium-voltage radial distribution feeders
Abstract
For fast timescales or long prediction horizons, the AC optimal power flow (OPF) problem becomes a computational challenge for large-scale, realistic AC networks. To overcome this challenge, this paper presents a novel network reduction methodology that leverages an efficient mixed-integer linear programming (MILP) formulation of a Kron-based reduction that is optimal in the sense that it balances the degree of the reduction with resulting modeling errors in the reduced network. The method takes as inputs the full AC network and a pre-computed library of AC load flow data and uses the graph Laplacian to constraint nodal reductions to only be feasible for neighbors of non-reduced nodes. This results in a highly effective MILP formulation which is embedded within an iterative scheme to successively improve the Kron-based network reduction until convergence. The resulting optimal network…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimal Power Flow Distribution · Electric Power System Optimization · Power System Optimization and Stability
