Abstract
We introduce a group of facility location problems whose objective involves both congestion and covering effects. For the Stochastic Queue Center problem, a single facility is to be located on a network to minimize expected response time (travel time plus expected queue delay) to the furthest demand point. We demonstrate certain convexity properties of the objective function on a general network, and show how the optimal location can be found using a finite-step algorithm. On a tree network, we characterize the optimal location trajectory as a function of the customer call rate. We compare this problem to the median, center, and Stochastic Queue Median problems. We then consider several different extensions which incorporate probabilistic travel times and/or distribution of demands.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Batta, A. Ghose and U. Palekar, Locating facilities on the Manhattan metric with arbitrarily shaped barriers and convex forbidden regions, Transp. Sci. 23(1989)26–36.
O. Berman, Locating a facility on a congested network with random lengths, Networks 15(1985)275–293.
O. Berman, R.C. Larson and S.S. Chiu, Optimal server location on a network operating as anM/G/1 queue, Oper. Res. 33(1985)746–770.
M.L. Brandeau, Characterization of the stochastic queue median trajectory in a plane with generalized distances, Oper. Res. 40(1992)331–341.
M.L. Brandeau and S.S. Chiu, ParametricL p norm location on a tree network, Transp. Sci. 22(1988)59–69.
M.L. Brandeau and S.S. Chiu, Establishing continuity of certain optimal parametric facility location trajectories, Transp. Sci. 22(1988)224–225.
M.L. Brandeau and S.S. Chiu, Trajectory analysis of the stochastic queue median in a plane with rectilinear distances, Transp. Sci. 24(1990)230–243.
M.L. Brandeau and R.C. Larson, Extending and applying the hypercube queueing model to deploy ambulances in Boston, in:Management Science and the Delivery of Urban Service, ed. E. Ignall and A.J. Swersey, TIMS Studies in the Management Sciences Series, vol. 22 (North-Holland/Elsevier, 1986) pp. 121–154.
S.S. Chiu, Optimal trajectory of the stochastic queue median as demand rate varies, Working Paper, Engineering-Economic Systems Department, Stanford University (1988).
S.S. Chiu, O. Berman and R.C. Larson, Locating a mobile server queueing facility on a tree network, Mang. Sci. 31(1985)764–772.
S.S. Chiu and R.C. Larson, Locating ann-server facility in a stochastic environment, Comput. Oper. Res. 12(1985)509–516.
Z. Drezner, S. Schaible and D. Simchi-Levi, Queueing-location problems on the plane, Naval Res. Logistics, 37(1990)929–935.
F.X. Finn, H.W. Findley and J.F. Molloy, Quincy (Massachusetts) police department: Application of the hypercube model for sector design analysis, in:Police Deployment, Urban Public Safety Systems Series vol. 1 (Lexington Books, 1978) chap. 8.
S.L. Hakimi, Optimal locations of switching centers and the absolute centers and medians of a graph, Oper. Res. 12(1964)450–459.
J.P. Jarvis and M.A. McKnew, Applying the hypercube in Arlington, Massachusetts, in:Police Deployment, Urban Public Safety Systems Series vol. 1 (Lexington Books, 1978) chap. 7.
R.C. Larson, A hypercube queueing model for facility location and redistricting in urban emergency services, Comput. Oper. Res. 1(1974)67–95.
O. Maimon and J. Halpern, The Lorentz measure in locational decisions on trees, to appear in Oper. Res.
P.B. Mirchandani and A.R. Odoni, Location of medians on stochastic networks, Transp. Sci. 13(1979)85–97.
Author information
Authors and Affiliations
Additional information
This work was partially supported by National Science Foundation Award DDM8858355.
Rights and permissions
About this article
Cite this article
Brandeau, M.L., Chiu, S.S. A center location problem with congestion. Ann Oper Res 40, 17–32 (1992). https://doi.org/10.1007/BF02060468
Issue Date:
DOI: https://doi.org/10.1007/BF02060468