Skip to main content
Log in

Location of Multiple-Server Congestible Facilities for Maximizing Expected Demand, when Services are Non-Essential

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We formulate a model for locating multiple-server, congestible facilities. Locations of these facilities maximize total expected demand attended over the region. The effective demand at each node is elastic to the travel time to the facility, and to the congestion at that facility. The facilities to be located are fixed, so customers travel to them in order to receive service or goods, and the demand curves at each demand node (which depend on the travel time and the queue length at the facility), are known. We propose a heuristic for the resulting integer, nonlinear formulation, and provide computational experience.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Batta, R. (1988). “Single Server Queuing –Location Models with Rejection.” Transportation Science 22, 209–216.

    Google Scholar 

  • Batta, R. (1989). “A Queuing –Location Model with Expected Service Time Dependent Queuing Disciplines.” European Journal of Operational Research 39, 192–205.

    Google Scholar 

  • Batta R., J. Dolan, and N. Krishnamurthy (1989). “The Maximal Expected Covering Location Problem: Revisited.” Transportation Science 23, 277–287.

    Google Scholar 

  • Batta, R., R. Larson, and A. Odoni. (1988). “A Single-Server Priority Queueing –Location Model.” Networks 8, 87–103.

    Google Scholar 

  • Berman, O. and E.H. Kaplan. (1987). “Facility Location and Capacity Planning with Delay-Dependent Demand.” International Journal of Production Research 25(12), 1773–1780.

    Google Scholar 

  • Berman, O. and R. Larson. (1985). “Optimal 2-Facility Network Districting in the Presence of Queuing.” Transportation Science 19, 261–277.

    Google Scholar 

  • Berman, O., R. Larson, and S. Chiu. (1985). “Optimal Server Location on a Network Operating as a M/G/1 Queue.” Operations Research 12(4), 746–771.

    Google Scholar 

  • Berman, O., R. Larson, and C. Parkan. (1987). “The Stochastic Queue p-Median Location Problem.” Transportation Science 21, 207–216.

    Google Scholar 

  • Berman, O. and R. Mandowsky. (1986). “Location–Allocation on Congested Networks.” European Journal of Operational Research 26, 238–250.

    Google Scholar 

  • Brandeau, M., S. Chiu, S. Kumar, and T. Grossman. (1995). “Location with Market Externalities.” In Z. Drezner (ed.), Facility Location: A Survey of Applications and Methods. New York: Springer.

    Google Scholar 

  • Cadwallader, M. (1975). “Behavioral Model of Consumer Spatial Decision Making.” Economic Geography 51, 339–349.

    Google Scholar 

  • Church, R. and C. ReVelle. (1974). “The Maximal Covering Location Problem.” Papers of the Regional Science Association 32, 101–118.

    Google Scholar 

  • Daskin, M. (1995). Networks and Discrete Location: Models, Algorithms and Applications. Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley.

    Google Scholar 

  • Daskin, M., K. Hogan, and C. ReVelle. (1988). “Integration of Multiple, Excess, Backup, and Expected Covering Models.” Environment and Planning B: Planning and Design 15, 15–35.

    Google Scholar 

  • Daskin, M. and E. Stern. (1981). “A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment.” Transportation Science 15, 137–152.

    Google Scholar 

  • Hakimi, S.L. (1964). “Optimal Locations of Switching Centers and the Absolute Centers and Medians of a Graph.” Operations Research 12, 450–459.

    Google Scholar 

  • Hillier, F.S. and G.J. Lieberman. (1986). Introduction to Operations Research. Oakland, CA: Holden-Day.

    Google Scholar 

  • Hogan, K. and C. ReVelle. (1986). “Concepts and Applications of Backup Coverage.” Management Science 32, 1434–1444.

    Google Scholar 

  • Jamil, M., A. Baveja, and R. Batta. (1999). “The Stochastic Queue Center Problem.” Computers and Operations Research 26, 1423–1436.

    Google Scholar 

  • Labbé, M. and S.L. Hakimi. (1991). “Market and Locational Equilibrium for Two Competitors.” Operations Research 39, 749–756.

    Google Scholar 

  • Larson, R. and A. Odoni. (1981). Urban Operations Research. Englewood Cliffs, NJ: Prentice Hall.

    Google Scholar 

  • Lee, H.L. and M.A. Cohen. (1985). “Equilibrium Analysis of Disaggregate Facility Choice Systems Subject to Congestion Elastic Demand.” Operations Research 33(2), 293–311.

    Google Scholar 

  • Marianov, V. and C. ReVelle. (1992). “A Probabilistic Fire Protection Siting Model with Joint Vehicle Reliability Requirements.” Papers in Regional Science 71, 217–241.

    Google Scholar 

  • Marianov, V. and C. Revelle. (1994). “The Queuing Probabilistic Location Set Covering Problem and Some Extensions.” Socio-Economic Planning Sciences 28(3), 167–178.

    Google Scholar 

  • Marianov, V. and C. ReVelle. (1995). “Siting of Emergency Services.” In Z. Drezner (ed.), Facility Location: A Survey of Applications and Methods. New York: Springer.

    Google Scholar 

  • Marianov, V. and C. Revelle. (1996). “The Queuing Maximal Availability Location Problem: a Model for the Siting of Emergency Vehicles.” European Journal of Operations Research 93, 110–120.

    Google Scholar 

  • Marianov, V. and D. Serra. (1998). “Probabilistic Maximal Covering Location–Allocation for Congested Systems.” Journal of Regional Science 38 (3), 401–424.

    Google Scholar 

  • Marianov, V. and D. Serra. (2000). “Hierarchical Location–Allocation Models for Congested Systems.” European Journal of Operational Research, forthcoming.

  • ReVelle, C. and R. Church. (1977). “A Spatial Model for the Location Construct of Teitz.” Papers of the Regional Science Association 39, 129–135.

    Google Scholar 

  • ReVelle, C. and V. Marianov. (1991). “A Probabilistic FLEET Model with Individual Vehicle Reliability Requirements.” European Journal of Operational Research 53, 93–105.

    Google Scholar 

  • ReVelle, C. and S. Swain. (1970). “Central Facilities Location.” Geographical Analysis 2, 30–42.

    Google Scholar 

  • Rosing, K. and C. ReVelle. (1997). “Heuristic Concentration: Two Stage Solution Construction.” European Journal of Operational Research 97, 75–86.

    Google Scholar 

  • Toregas, C., R. Swain, C. ReVelle, and L. Bergmann. (1971). “The Location of Emergency Service Facilities.” Operations Research 19, 1363–1373.

    Google Scholar 

  • Wagner, J.L. and L.M. Falkson. (1975). “The Optimal Nodal Location of Public Facilities with Price-Sensitive Demand.” Geographical Analysis 7, 69–83.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marianov, V. Location of Multiple-Server Congestible Facilities for Maximizing Expected Demand, when Services are Non-Essential. Annals of Operations Research 123, 125–141 (2003). https://doi.org/10.1023/A:1026171212594

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026171212594

Navigation