Skip to main content

Advertisement

Log in

The multiple server center location problem

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

Abstract

In this paper, we introduce the multiple server center location problem. p servers are to be located at nodes of a network. Demand for services of these servers is located at each node, and a subset of nodes are to be chosen to locate one or more servers in each. Each customer selects the closest server. The objective is to minimize the maximum time spent by any customer, including travel time and waiting time at the server sites. The problem is formulated and analyzed. Results for heuristic solution approaches are reported.

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.

Institutional subscriptions

Similar content being viewed by others

References

  • Batta, R., & Berman, O. (1989). A location model for a facility operating M/G/K queue. Networks, 19, 717–728.

    Article  Google Scholar 

  • Beasley, J. E. (1990). OR-library—distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069–1072. Also available at http://people.brunel.ac.uk/~mastjjb/jeb/info.html.

    Article  Google Scholar 

  • Berman, O., & Drezner, Z. (2007). The multiple server location problem. Journal of the Operational Research Society, 58, 91–99.

    Article  Google Scholar 

  • Berman, O., & Krass, D. (2002a). Facility location problems with stochastic demands and congestion. In Z. Drezner & H. W. Hamacher (Eds.), Location analysis: applications and theory (pp. 329–371). New York: Springer. Chap. 11.

    Google Scholar 

  • Berman, O., & Krass, D. (2002b). Recent developments in the theory and applications of location models, Part II. Annals of Operations Research, 111, 15–16.

    Article  Google Scholar 

  • Berman, O., & Mandowsky, R. (1986). Location-allocation on congested networks. European Journal of Operations Research, 26, 238–250.

    Article  Google Scholar 

  • Berman, O., Larson, R. C., & Chiu, S. (1985). Optimal server location on a network operating as an M/G/1 queue. Operations Research, 33, 746–771.

    Article  Google Scholar 

  • Berman, O., Larson, R. C., & Parkan, C. (1987). The stochastic queue p-median problem. Transportation Science, 21, 207–216.

    Article  Google Scholar 

  • Berman, O., Krass, D., & Wang, J. (2006). Locating service facilities to reduce lost demand. IIE Transactions, 38, 933–946.

    Article  Google Scholar 

  • Castillo, I., Ingolfsson, A., & Sim, T. (2002). Socially optimal location of facilities with fixed servers, stochastic demand and congestion (Management Science Working Paper 02-4). University of Alberta School of Business, Edmonton, Canada.

  • Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13, 533–549.

    Article  Google Scholar 

  • Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic.

    Google Scholar 

  • Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley.

    Google Scholar 

  • Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press.

    Google Scholar 

  • Kirkpatrick, S., Gelat, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680.

    Article  Google Scholar 

  • Klienrock, L. (1975). Queueing systems. New York: Wiley.

    Google Scholar 

  • Marianov, V., & Rios, M. (2000). A probabilistic quality of service constraint for a location model of switches in ATM communications networks. Annals of Operations Research, 96, 237–243.

    Article  Google Scholar 

  • Marianov, V., & Serra, D. (1998). Probabilistic maximal covering location-allocation for congested systems. Journal of Regional Science, 38, 401–424.

    Article  Google Scholar 

  • Pasternack, B. A., & Drezner, Z. (1998). A note on calculating steady state results for an M/M/k queuing system when the ratio of the arrival rate to the service rate is large. Journal of Applied Mathematics and Decision Sciences, 2, 133–135.

    Article  Google Scholar 

  • Teitz, M. B., & Bart, P. (1968). Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16, 955–961.

    Article  Google Scholar 

  • Wang, Q., Batta, R., & Rump, C. M. (2002). Algorithms for a facility location problem with stochastic customer demand and immobile servers. Annals of Operations Research, 111, 17–34.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Robert Aboolian.

Additional information

Paper was partially supported by a College of Business Administration, California State University San Marcos summer grant of the first author.

Paper was partially supported by an NSERC grant of the second author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aboolian, R., Berman, O. & Drezner, Z. The multiple server center location problem. Ann Oper Res 167, 337–352 (2009). https://doi.org/10.1007/s10479-008-0341-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0341-2

Keywords

Navigation