The Stochastic Queue p-Median Problem

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.