Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts

TL;DR

This paper introduces a new integer programming approach to optimize sensor placement in power grids by solving a power dominating set problem, significantly improving computational efficiency over existing methods.

Contribution

It formulates a novel set cover model for the power dominating set problem and demonstrates its superior runtime performance through computational experiments.

Findings

Proposed method outperforms existing approaches by an order of magnitude in runtime.

Structural properties of neighborhoods of zero forcing forts are analyzed.

The integer program can be effectively solved via row generation.

Abstract

To monitor electrical activity throughout the power grid and mitigate outages, sensors known as phasor measurement units can installed. Due to implementation costs, it is desirable to minimize the number of sensors deployed while ensuring that the grid can be effectively monitored. This optimization problem motivates the graph theoretic power dominating set problem. In this paper, we propose a novel integer program for identifying minimum power dominating sets by formulating a set cover problem. This problem's constraints correspond to neighborhoods of zero forcing forts; we study their structural properties and show they can be separated, allowing the proposed model to be solved via row generation. The proposed and existing methods are compared in several computational experiments in which the proposed method consistently exhibits an order of magnitude improvement in runtime performance.