Recursive Restoration Refinement: A Fast Heuristic for Near-Optimal Restoration Prioritization in Power Systems
The prioritization of restoration actions after large power system outages plays a key role in how quickly power can be restored. It has been shown that fast and intuitive heuristics for restoration prioritization most often result in low-quality restoration plans. Meanwhile, mathematical optimization tools that find high-quality restoration plans are too slow to be applied to restoration planning problems of practical interest. This work makes a significant step in closing this quality vs compute time gap by proposing the Recursive Restoration Refinement heuristic for power system restoration. This heuristic is shown to produce near-optimal restoration plans up to 1,000 times faster than other state-of-the-art solution methods on a range of test cases with up to 500 buses and 700 damaged components. The potential impact of this new heuristic is demonstrated by a preliminary analysis of the key features of high-quality restoration plans. The recursive restoration refinement algorithm and other methods explored in this work have been made available as part of the open-source software package, PowerModelsRestoration, to support ongoing research in power restoration algorithms.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Matrix Factorisation with Linear Filters
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix…
Image RestorationAn Iterative Heuristic Method to Determine Radial Topology for Distribution System Restoration
Coordinating multiple local power sources can restore critical loads after the major outages caused by extreme events. A radial topology is needed for distribution system restoration, while determining a good topology in…
Making the Nyström method highly accurate for low-rank approximations
The Nystr\"om method is a convenient heuristic method to obtain low-rank approximations to kernel matrices in nearly linear complexity. Existing studies typically use the method to approximate positive semidefinite matri…
Fast Synthesis for Symbolic Self-triggered Control under Right-recursive LTL Specifications
We extend previous work on symbolic self-triggered control for non-deterministic continuous-time nonlinear systems without stability assumptions to a larger class of specifications. Our goal is to synthesise a controller…
Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering
Weighted correlation clustering is hard to solve and hard to approximate for general graphs. Its applications in network analysis and computer vision call for efficient algorithms. To this end, we make three contrib…
Clustering