论文标题
连续覆盖与互连设施的位置问题
Continuous maximal covering location problems with interconnected facilities
论文作者
论文摘要
在本文中，我们分析了最大覆盖位置问题的连续版本，其中要求设施通过图形结构进行互连，如果给定距离不超过两个设施，则允许两个设施链接。我们为问题和不同的分辨率策略提供了数学编程框架。首先，我们提出了一个混合整数非线性编程公式，并得出了问题的属性，使我们能够将连续变量投射出避免非线性约束，从而导致等效的纯整数编程公式。由于整数编程公式中的约束数量很大，并且通常难以处理约束，因此我们提出了两种分支 - ＆ - 切割方法，以避免对约束的完全枚举，从而导致更有效的程序。我们报告了比较不同方法的性能的大量计算实验的结果。
In this paper we analyze a continuous version of the maximal covering location problem, in which the facilities are required to be interconnected by means of a graph structure in which two facilities are allowed to be linked if a given distance is not exceed. We provide a mathematical programming framework for the problem and different resolution strategies. First, we propose a Mixed Integer Non Linear Programming formulation, and derive properties of the problem that allow us to project the continuous variables out avoiding the nonlinear constraints, resulting in an equivalent pure integer programming formulation. Since the number of constraints in the integer programming formulation is large and the constraints are, in general, difficult to handle, we propose two branch-&-cut approaches that avoid the complete enumeration of the constraints resulting in more efficient procedures. We report the results of an extensive battery of computational experiments comparing the performance of the different approaches.
