有容量的功率支配集问题:基于禁止传播集的求解方法
Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
AI总结:
本文提出了一种基于禁止传播集的新方法,用于解决有容量的功率支配集问题,通过引入新的组合结构来改进整数线性规划模型,并通过计算实验验证了该方法在处理大规模网络时的高效性。
摘要:
在电力系统中,测量设备的最优布置通常通过功率支配集问题建模。然而,在实际应用中,这些设备有容量限制,导致出现有容量的变种问题,该问题在文献中鲜有关注。本文引入了禁止传播集,这些新的组合结构不能同时出现在任何可行解中。这一概念使一种新的整数线性规划公式得以建立。它们结合了基于感染的变量和指数级多约束,同时避免了大M约束。我们推导了结构性质、有效不等式和打破冗余的约束,并设计了基于循环检测的高效懒惰分离程序。在包含最多14000个顶点的基准实例上的计算实验表明,所提出的方法在现有方法基础上平均执行时间提高了1.7倍。此外,结果表明,性能不仅取决于网络大小,还取决于容量。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。