arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.00284math.OCcs.DM
收藏

网络上的连续覆盖:改进的混合整数规划公式

Continuous Covering on Networks: Improved Mixed Integer Programming Formulations

Mercedes Pelegrín, Liding Xu

摘要:

覆盖问题在运筹学领域,更具体地说,在选址科学中得到了很好的研究。当位置空间是一个网络时,最常见的假设是将候选设施位置、要覆盖的点或两者都视为离散集。在这项工作中,我们研究了集覆盖定位问题时,候选位置和需求点是连续集的网络。这种变体很少受到关注,并且现有的稀缺方法都集中在特定的情况下,如树网络和整数覆盖半径。本文研究了这一一般性问题,提出了一个边的长度不大于大于覆盖半径的网络的混合规划线性规划公式(MILP)。该模型并没有失去一般性,因为任何不满足这个条件的边缘可以被划分成适当长度的子边缘,而不会改变问题。我们提出了一个预处理算法,以减少大小的MILP,并设计紧密的大$M$常数和有效的不等式,以加强我们的配方。此外,还提出了第二种MILP,它允许边长大于覆盖半径。与现有的问题公式(包括本文提出的第一MILP)相反,第二模型的变量和约束的数量不依赖于网络边缘的长度。第二种模型代表了一种可扩展的方法,特别适合现实世界的网络,其边缘通常大于覆盖半径。我们的计算实验显示了我们的精确方法在现实世界和随机网络上的优势和局限性。我们的配方也测试对现有的精确方法。

英文摘要:

Covering problems are well-studied in the domain of Operations Research, and, more specifically, in Location Science. When the location space is a network, the most frequent assumption is to consider the candidate facility locations, the points to be covered, or both, to be discrete sets. In this work, we study the set-covering location problem when both candidate locations and demand points are continuous sets on a network. This variant has received little attention, and the scarce existing approaches have focused on particular cases, such as tree networks and integer covering radius. Here we study the general problem and present a Mixed Integer Linear Programming formulation (MILP) for networks with edges' lengths no greater than the covering radius. The model does not lose generality, as any edge not satisfying this condition can be partitioned into subedges of appropriate lengths without changing the problem. We propose a preprocessing algorithm to reduce the size of the MILP, and devise tight big-$M$ constants and valid inequalities to strengthen our formulations. Moreover, a second MILP is proposed, which admits edges' lengths greater than the covering radius. As opposed to existing formulations of the problem (including the first MILP proposed herein), the number of variables and constraints of this second model does not depend on the lengths of the network's edges. This second model represents a scalable approach that particularly suits real-world networks, whose edges are usually greater than the covering radius. Our computational experiments show the strengths and limitations of our exact approach on both real-world and random networks. Our formulations are also tested against an existing exact method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑