Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks using Submodularity
Cyrus Hettle, Swati Gupta, Daniel Molzahn

TL;DR
This paper introduces the MRT problem for reducing outage times in electric distribution networks, formulates it as a submodular optimization problem, and develops approximation algorithms with practical validation.
Contribution
It formulates the MRT problem, proves its NP-hardness, and provides a polynomial-time approximation algorithm using kernel-based randomized rounding.
Findings
Improves outage recovery times in synthetic networks
Balances multiple objectives in network reconfiguration
Enhances service equity across different areas
Abstract
Increasing reliability and reducing disruptions in supply networks are of increasing importance; for example, power outages in electricity distribution networks cost $35-50 billion annually in the US. Motivated by the operational constraints of such networks and their rapid adoption of decentralized paradigms and self-healing components, we introduce the "minimum reconnection time" (MRT) problem. MRT seeks to reduce outage time after network disruptions by programming reconnection times of different edges (i.e., switches), while ensuring that the operating network is acyclic. We show that MRT is NP-hard and is a special case of the well-known minimum linear ordering problem (MLOP) in the submodular optimization literature. MLOP is a special case of a broader class of ordering problems that often admit polynomial time approximation algorithms. We develop the theory of kernel-based…
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 · Software-Defined Networks and 5G · Complexity and Algorithms in Graphs
