带截断的定位问题
Location problems with cutoff
摘要:
在本文中,我们研究了一个广义版本的韦伯问题,找到一个点,最大限度地减少其距离的总和,有限数量的给定点。在我们的设置中,这些距离可以是给定值$C > 0$的$cut$ $off$,并且我们允许以固定成本$C'$选择$empty$解决方案。我们分析了在什么情况下这些问题可以简化为更简单的韦伯问题,以及当我们肯定要解决更复杂的问题与截止。我们还提出了[Drezner等人,1991,$Transportation$ $Science$ 25(3),183 - 187],这在某些情况下能够大大减少计算时间,如在模拟研究中所证明的。相对于截止值的灵敏度也进行了研究,这使我们能够提供一种算法,有效地解决了问题,同时为所有$C>0$。
英文摘要:
In this paper we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting these distances may be $cut$ $off$ at a given value $C > 0$, and we allow for the option of an $empty$ solution at a fixed cost $C'$. We analyze under which circumstances these problems can be reduced to the simpler Weber problem, and also when we definitely have to solve the more complex problem with cutoff. We furthermore present adaptions of the algorithm of [Drezner et al., 1991, $Transportation$ $Science$ 25(3), 183--187] to our setting, which in certain situations are able to substantially reduce computation times as demonstrated in a simulation study. The sensitivity with respect to the cutoff value is also studied, which allows us to provide an algorithm that efficiently solves the problem simultaneously for all $C>0$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。