最大覆盖选址问题中的边升级问题
Upgrading edges in the maximal covering location problem
AI总结:
针对带预算约束的边长可调整最大覆盖选址NP难问题,提出三种混合整数规划公式、预处理策略及有效不等式强化方案,并通过多数据集测试对比了各方案的性能。
摘要:
我们研究了网络中边长可修改的最大覆盖选址问题的升级版本。该问题旨在在网络顶点上布设p个设施以实现覆盖最大化,同时考虑可通过付出成本缩短边长,且该操作受给定预算约束。因此,我们需要确定p个设施的最优位置以及最优的边长缩减方案。该问题在一般图上属于NP难问题。为求解该问题,我们提出了三种不同的混合整数规划公式,以及一个用于固定变量、移除部分约束的预处理阶段。此外,我们通过引入有效不等式强化了所提出的公式。最后,我们在不同数据集上测试了三种公式及其对应改进版本的性能,并对结果进行了比较。
英文摘要:
We study the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem aims at locating p facilities on the vertices (of the network) so as to maximise coverage, considering that the length of the edges can be reduced at a cost, subject to a given budget. Hence, we have to decide on: the optimal location of p facilities and the optimal edge length reductions. This problem is NP-hard on general graphs. To solve it, we propose three different mixed-integer formulations and a preprocessing phase for fixing variables and removing some of the constraints. Moreover, we strengthen the proposed formulations including valid inequalities. Finally, we compare the three formulations and their corresponding improvements by testing their performance over different datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。