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

概率p中心问题:为潜在客户规划服务

The probabilistic p-center problem: Planning service for potential customers

Luisa I. Martínez-Merino, Maria Albareda-Sambola, Antonio M. Rodríguez-Chía

AI总结:

本文研究面向潜在客户的概率p中心服务规划问题,提出多种问题公式与可变邻域搜索启发式算法,通过实验验证了各公式的优劣势及启发式算法的有效性。

摘要:

本文研究概率p中心问题,该问题的目标是在考虑每个站点以特定概率存在需求的前提下,最小化任意有需求站点与其对应中心之间的期望最大距离。该问题适用于紧急事件可能以已知概率发生在预设站点的场景。针对此问题,我们提出并分析了不同的公式表达,以及一种可变邻域搜索(Variable Neighborhood Search)启发式算法。文中报告了计算测试结果,展示了每种公式表达的潜力与局限、其改进方案的影响,以及该启发式算法的有效性。

英文摘要:

This work deals with the probabilistic p-center problem, which aims at minimizing the expected maximum distance between any site with demand and its center, considering that each site has demand with a specific probability. The problem is of interest when emergencies may occur at predefined sites with known probabilities. For this problem we propose and analyze different formulations as well as a Variable Neighborhood Search heuristic. Computational tests are reported, showing the potentials and limits of each formulation, the impact of their enhancements, and the effectiveness of the heuristic.

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

↑