Journal of the Operational Research Society

, Volume 54, Issue 8, pp 871–877

A probabilistic one-centre location problem on a network

Theoretical Paper

DOI: 10.1057/palgrave.jors.2601594

Cite this article as:
Berman, O. & Drezner, Z. J Oper Res Soc (2003) 54: 871. doi:10.1057/palgrave.jors.2601594

Abstract

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.

Keywords

locationcomputational analysisnetworks and graphsstochastic optimization

Copyright information

© Palgrave Macmillan Ltd 2003

Authors and Affiliations

  1. 1.University of TorontoTorontoCanada
  2. 2.California State University-FullertonFullertonUSA