A probabilistic one-centre location problem on a network
A probabilistic one-centre location problem on a network
复制标题
网络上的概率单中心位置问题
DOI：
10.1057/palgrave.jors.2601594
复制
发表时间：
2003
影响因子：
3.6
通讯作者：
Z. Drezner
中科院分区：
文献类型：
--
作者：
O. Berman;Z. Drezner
在这篇文章中，我们考虑了当链路上的速度是随机的而不是确定性的时网络上的单中心问题。给定到达驻留在节点的客户的期望时间，目标是找到设施的位置，使得在该时间阈值内到达所有节点的概率最大化。利用多元正态概率对问题进行了描述、分析和求解。通过一道例题说明了该方法的有效性。
In this paper we consider the one-centre problem on a network when the speeds on links are stochastic rather than deterministic. Given a desirable time to reach customers residing at the nodes, the objective is to find the location for a facility such that the probability that all nodes are reached within this time threshold is maximized. The problem is formulated, analyzed and solved by using multivariate normal probabilities. The procedure is demonstrated on an example problem.