arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.11346math.OCcs.DM
收藏

面向带绝对和相对后悔目标的嵌套$p$-中心问题的混合整数线性规划方法

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives

Christof Brandstetter, Markus Sinnl

AI总结:

该研究提出多周期嵌套$p$-中心问题,针对绝对后悔和相对后悔两类目标分别构建混合整数规划公式与有效不等式,开发带预处理的分支定界/切割算法,通过算例验证并分析了嵌套对成本及设施数的影响。

摘要:

我们提出了嵌套$p$-中心问题,它是经典$p$-中心问题的多周期变体。嵌套概念的应用可得到在考虑的时间范围内具有一致性的解,即在给定时间段内开放的设施在后续时间段内保持开放。这在实际应用中十分重要,因为不同时间段之间关闭(以及后续可能重新开放)设施往往是不可取的。\n我们研究了该问题的两个不同版本,二者的区别在于目标函数。第一个版本考虑所有时间段内(嵌套的)绝对后悔值之和,第二个版本则以最小化各时间段内的最大相对后悔值为目标。\n针对带绝对后悔目标的版本,我们提出了三种混合整数规划公式;针对带相对后悔目标的版本,我们提出了两种规划公式。我们为所有公式都推导了有效不等式。基于这些规划公式与有效不等式,我们开发了分支定界/分支切割求解算法。这些算法包含一个利用嵌套特性的预处理流程,同时还集成了初始启发式算法和原启发式算法。\n我们对文献中$p$-中心问题的算例进行了调整以适配我们的问题,并开展了计算研究。我们还分析了嵌套特性对求解成本和开放设施数量的影响。

英文摘要:

We introduce the nested $p$-center problem, which is a multi-period variant of the well-known $p$-center problem. The use of the nesting concept allows to obtain solutions, which are consistent over the considered time horizon, i.e., facilities which are opened in a given time period stay open for subsequent time periods. This is important in real-life applications, as closing (and potential later re-opening) of facilities between time periods can be undesirable. We consider two different versions of our problem, with the difference being the objective function. The first version considers the sum of the absolute regrets (of nesting) over all time periods, and the second version considers minimizing the maximum relative regret over the time periods. We present three mixed-integer programming formulations for the version with absolute regret objective and two formulations for the version with relative regret objective. For all the formulations, we present valid inequalities. Based on the formulations and the valid inequalities, we develop branch-and-bound/branch-and-cut solution algorithms. These algorithms include a preprocessing procedure that exploits the nesting property and also begins heuristics and primal heuristics. We conducted a computational study on instances from the literature for the $p$-center problem, which we adapted to our problems. We also analyse the effect of nesting on the solution cost and the number of open facilities.

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

↑