A probabilistic one-centre location problem on a network

O Berman and Z Drezner ()
Additional contact information
O Berman: University of Toronto
Z Drezner: California State University-Fullerton

Journal of the Operational Research Society, 2003, vol. 54, issue 8, 871-877

Abstract: 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: location; computational analysis; networks and graphs; stochastic optimization (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601594 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:54:y:2003:i:8:d:10.1057_palgrave.jors.2601594

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601594

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().