Capacitated power dominating set problem: a solution approach based on forbidden propagation sets

TL;DR

This paper introduces a new approach for the capacitated power dominating set problem using forbidden propagation sets, leading to improved solution methods for large electrical networks.

Contribution

It proposes forbidden propagation sets and a novel ILP formulation that enhances computational efficiency for the capacitated power dominating set problem.

Findings

Achieves 1.7x faster solutions on benchmark instances

Performance depends on network size and device capacities

Introduces structural properties and valid inequalities for the problem

Abstract

The optimal placement of measurement devices in electrical power systems is commonly modeled through the power dominating set problem. However, in real-world applications, these devices have limited capacities, leading to a capacitated variant of the problem that has received little attention in the literature. In this work, we introduce forbidden propagation sets, novel combinatorial structures that cannot occur simultaneously in any feasible solution. This notion enables a new class of integer linear programming formulations. They combine infection-based variables with exponentially many constraints, while avoiding big-$M$ constraints. We derive structural properties, valid inequalities, and redundancy-breaking constraints, and design an efficient lazy-separation procedure based on cycle detection. Computational experiments on benchmark instances with up to 14,000 vertices show that the proposed method achieves an average execution-time improvement of 1.7x over existing approaches adapted from the literature. Moreover, the results indicate that performance depends not only on network size, but also on capacities.