A K-Nearest Neighbor Heuristic for Real-Time DC Optimal Transmission Switching

arXiv2003.10565MaRDI QIDQ6337285FDOQ6337285

Authors: Emma S. Johnson, S. Ahmed, Santanu S. Dey, Jean-Paul Watson 

Publication date: 23 March 2020

Abstract: While transmission switching is known to reduce power generation costs, the difficulty of solving even DC optimal transmission switching (DCOTS) has prevented optimal transmission switching from becoming commonplace in real-time power systems operation. In this paper, we present a k-nearest neighbors (KNN) heuristic for DCOTS which relies on the insight that, for routine operations on a fixed network, the DCOTS solutions for similar load profiles and generation cost profiles will likely turn off similar sets of lines. We take a data-driven approach and assume that we have DCOTS solutions for many historical instances, which is realistic given that the problem is solved every 5 minutes in practice. Given a new instance, we find a set of "close" instances from the past and return the best of their solutions for the new instance. We present a case study on 7 test networks ranging in size from 118 to 3,375 buses. We compare the proposed heuristic to DCOTS heuristics from the literature, commercial solver heuristics, and a simple greedy local search algorithm. In most cases, we find better quality solutions in less computational time. In addition, the computational time is within the limits imposed by real-time operations, even on larger networks. Last, we present an empirical study of our training data to understand why the heuristic works well.

This page was built for publication: A K-Nearest Neighbor Heuristic for Real-Time DC Optimal Transmission Switching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337285)