Mixed-integer linear programming approaches for tree partitioning of power networks
Leon Lan, Alessandro Zocca

TL;DR
This paper introduces a MILP-based framework and heuristic for tree partitioning in power networks, aiming to improve robustness by strategic topology modifications, with extensive experiments showing significant load loss reduction.
Contribution
It presents a novel MILP formulation and a two-stage heuristic for tree partitioning, advancing the optimization methods for power network robustness.
Findings
MILP formulation effectively solves tree partitioning problems
Heuristic methods perform well in numerical experiments
Tree partitioning strategies reduce load loss significantly
Abstract
In transmission networks, power flows and network topology are deeply intertwined due to power flow physics. Recent literature shows that a specific more hierarchical network structure can effectively inhibit the propagation of line failures across the entire system. In particular, a novel approach named tree partitioning has been proposed, which seeks to bolster the robustness of power networks through strategic alterations in network topology, accomplished via targeted line switching actions. Several tree partitioning problem formulations have been proposed by considering different objectives, among which power flow disruption and network congestion. Furthermore, various heuristic methods based on a two-stage and recursive approach have been proposed. The present work provides a general framework for tree partitioning problems based on mixed-integer linear programming (MILP). In…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimal Power Flow Distribution · Advanced Optical Network Technologies · Islanding Detection in Power Systems
