A probabilistic one-centre location problem on a network

被引：12

作者：

Berman, O

Drezner, Z ^{[1
]}

机构：

[1] Calif State Univ Fullerton, Coll Business & Econ, Fullerton, CA 92834 USA

[2] Univ Toronto, Toronto, ON, Canada

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2003年 / 54卷 / 08期

关键词：

location; computational analysis; networks and graphs; stochastic optimization;

D O I：

10.1057/palgrave.jors.2601594

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：871 / 877

页数：7

共 22 条

[1]

[Anonymous], 1975, P 16 ANN IEEE S FDN

[2]

BERMAN O, 2000, 1 MEDIAN 1 ANTIMEDIA

[3]

BERMAN O, 2003, IN PRESS IIE T

[4]

BERMAN O, 2001, PROBABILISTIC MINIMA