Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks

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 United States. 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, which models reliability metrics such as the System Average Interruption Duration Index (SAIDI). MRT seeks to reduce outage time after network disruptions by programming reconnection times of different edges (i.e., switches), ensuring that the operating network is acyclic. We show that MRT is NP-hard and is a special case of the well-known (weighted) minimum sum set cover (MSSC) problem. We develop the theory of kernel-based randomized rounding approaches to give a tight polynomial-time approximation for MSSC, improving the state-of-the-art approximation factor for these instances. Further, motivated by the reliability incentive structure for utility companies and operational energy losses in distribution networks, we study minimizing energy losses and reliability metrics such as SAIDI and reconnection times simultaneously. Optimizing for any single objective at a time can create unfair duration of expected outage for industrial and residential areas. We, therefore, propose local search over spanning trees to balance these multiple objectives. We computationally validate our reconfiguration methods on the National Renewable Energy Laboratory Synthetic Models for Advanced, Realistic Testing: Distribution Systems and Scenarios Greensboro synthetic network and show that this improves equity by a factor of four across industrial and residential areas. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: C. Hettle and D. Molzahn's research was partially supported by the National Science Foundation [Grant NSF 2112533], received by the Georgia Institute of Technology. S. Gupta’s research is supported by the National Science Foundation CAREER [Grant 2239824], received by the Massachusetts Institute of Technology. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0295 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0295 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Authors

Institutions

Publication Details

Journal
INFORMS journal on computing
Published
2025-03-28
DOI
https://doi.org/10.1287/ijoc.2022.0295
Primary Topic
Smart Grid Energy Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks

Daniel K. Molzahn, Cyrus Hettle, Swati Gupta
INFORMS journal on computing
Smart Grid Energy Management
article

Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks

Daniel K. Molzahn, Cyrus Hettle, Swati Gupta
article en

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 United States. 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, which models reliability metrics such as the System Average Interruption Duration Index (SAIDI). MRT seeks to reduce outage time after network disruptions by programming reconnection times of different edges (i.e., switches), ensuring that the operating network is acyclic. We show that MRT is NP-hard and is a special case of the well-known (weighted) minimum sum set cover (MSSC) problem. We develop the theory of kernel-based randomized rounding approaches to give a tight polynomial-time approximation for MSSC, improving the state-of-the-art approximation factor for these instances. Further, motivated by the reliability incentive structure for utility companies and operational energy losses in distribution networks, we study minimizing energy losses and reliability metrics such as SAIDI and reconnection times simultaneously. Optimizing for any single objective at a time can create unfair duration of expected outage for industrial and residential areas. We, therefore, propose local search over spanning trees to balance these multiple objectives. We computationally validate our reconfiguration methods on the National Renewable Energy Laboratory Synthetic Models for Advanced, Realistic Testing: Distribution Systems and Scenarios Greensboro synthetic network and show that this improves equity by a factor of four across industrial and residential areas. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: C. Hettle and D. Molzahn's research was partially supported by the National Science Foundation [Grant NSF 2112533], received by the Georgia Institute of Technology. S. Gupta’s research is supported by the National Science Foundation CAREER [Grant 2239824], received by the Massachusetts Institute of Technology. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0295 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0295 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

INFORMS journal on computingVol. 38(1)
Georgia Institute of Technology (US), Massachusetts Institute of Technology (US)
Openalex Percentile: Top 95%
Smart Grid Energy Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.