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

📅 2026-05-18
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This study addresses the optimal placement of measurement devices in power systems under capacity constraints, formalized as the capacitated power dominating set problem. The authors introduce a novel combinatorial structure termed the "forbidden propagation set," derive its structural properties, valid inequalities, and redundancy-elimination conditions, and formulate an integer linear programming model that avoids big-M constraints. By integrating infection variables with exponentially many constraints, they design an efficient delayed separation algorithm based on graph-theoretic cycle detection. Evaluated on benchmark instances with up to 14,000 nodes, the proposed approach achieves an average speedup of 1.7× over existing methods, demonstrating that performance is jointly influenced by network size and device capacity, thereby significantly enhancing scalability and computational efficiency for large-scale power systems.
📝 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.
Problem

Research questions and friction points this paper is trying to address.

capacitated power dominating set
power systems
measurement placement
capacity constraints
Innovation

Methods, ideas, or system contributions that make the work stand out.

forbidden propagation sets
capacitated power dominating set
integer linear programming
lazy-separation
big-M-free formulation
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
M
Mauro Lucci
Depto. de Matemática (FCEIA), Universidad Nacional de Rosario, Av. Pellegrini 250, Rosario 2000, Argentina; CONICET, Ocampo y Esmeralda, Rosario 2000, Argentina
D
Diego Delle Donne
ESSEC Business School, Department of Information Systems, Data Analytics and Operations, 3 avenue Bernard Hirsch, Cergy 95021, France
M
Mariana Escalante
Depto. de Matemática (FCEIA), Universidad Nacional de Rosario, Av. Pellegrini 250, Rosario 2000, Argentina; CONICET, Ocampo y Esmeralda, Rosario 2000, Argentina