The Stochastic Queue p -Median Problem

O. Berman, R. C. Larson and C. Parkan
Additional contact information
O. Berman: University of Massachusetts, Boston, Massachusetts
R. C. Larson: Massachusetts Institute of Technology, Cambridge, Massachusetts
C. Parkan: University of Calgary, Calgary, Alberta, Canada

Transportation Science, 1987, vol. 21, issue 3, 207-216

Abstract: This paper derives two easily programmable heuristic procedures for locating p mobile service units on a network in the presence of queueing-like congestion. Both heuristics take advantage of the Hypercube model, a location model for a single service unit, and a normalizing technique known as mean service time calibration. Heuristic 1 uses the 1-median problem, whereas heuristic 2 uses the stochastic queue median. A simulation model is employed to validate the results and compare the heuristics.

Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.21.3.207 (application/pdf)

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:inm:ortrsc:v:21:y:1987:i:3:p:207-216

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().