The multiple server center location problem
- 256 Downloads
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.
KeywordsGenetic Algorithm Feasible Solution Arrival Rate Service Rate Berman
Unable to display preview. Download preview PDF.
- 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
- 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. 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
- Klienrock, L. (1975). Queueing systems. New York: Wiley. Google Scholar