论文标题
半意见的P-Median问题的整数编程模型
Integer programming models for the semi-obnoxious p-median problem
论文作者
论文摘要
P-Median问题涉及设施的位置，因此需求点及其最近设施之间的距离之和最小化。我们研究了这个经典位置问题的一种变体，其中设施之间以及设施和需求点之间都存在最小距离限制。这种特定类型的问题可用于建模所在的设施是半斑点的情况。但是，尽管它与现实生活中的情景相关，但在广泛的文献中，它几乎没有关注位置问题。我们为此问题提供了十二个ILP模型，将P-Median问题的三个公式与距离约束的四个公式结合在一起。我们使用Gurobi Optimizer v9.0.3，以比较大型问题数据集中的这些ILP模型。实验结果表明，Revelle \＆Swain提出的经典P-Median模型以及Rosing等人提出的模型。是表现最好的人。
The p-median problem concerns the location of facilities so that the sum of distances between the demand points and their nearest facility is minimized. We study a variant of this classic location problem where minimum distance constraints exist both between the facilities and between the facilities and the demand points. This specific type of problem can be used to model situations where the facilities to be located are semi-obnoxious. But despite its relevance to real life scenarios, it has received little attention within the vast literature on location problems. We present twelve ILP models for this problem, coupling three formulations of the p-median problem with four formulations of the distance constraints. We utilize Gurobi Optimizer v9.0.3 in order to compare these ILP models on a large dataset of problems. Experimental results demonstrate that the classic p-median model proposed by ReVelle \& Swain and the model proposed by Rosing et al. are the best performers.
