A probabilistic one-centre location problem on a network

A probabilistic one-centre location problem on a network

0.00 Avg rating0 Votes
Article ID: iaor20041482
Country: United Kingdom
Volume: 54
Issue: 8
Start Page Number: 871
End Page Number: 877
Publication Date: Aug 2003
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: networks
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.

Reviews

Required fields are marked *. Your email address will not be published.