Locating emergency services with priority rules: The priority queuing covering location problem
AbstractOne of the assumptions of the Capacitated Facility Location Problem (CFLP) is that demand is known and fixed. Most often, this is not the case when managers take some strategic decisions such as locating facilities and assigning demand points to those facilities. In this paper we consider demand as stochastic and we model each of the facilities as an independent queue. Stochastic models of manufacturing systems and deterministic location models are put together in order to obtain a formula for the backlogging probability at a potential facility location. Several solution techniques have been proposed to solve the CFLP. One of the most recently proposed heuristics, a Reactive Greedy Adaptive Search Procedure, is implemented in order to solve the model formulated. We present some computational experiments in order to evaluate the heuristics’ performance and to illustrate the use of this new formulation for the CFLP. The paper finishes with a simple simulation exercise.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 642.
Date of creation: Sep 2002
Date of revision: May 2008
Contact details of provider:
Web page: http://www.econ.upf.edu/
Location; queuing; greedy heuristics; simulation;
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- L80 - Industrial Organization - - Industry Studies: Services - - - General
This paper has been announced in the following NEP Reports:
- NEP-ALL-2002-10-23 (All new papers)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Rajan Batta & Narasimha R. Mannur, 1990. "Covering-Location Models for Emergency Situations That Require Multiple Response Units," Management Science, INFORMS, vol. 36(1), pages 16-23, January.
- Marianov, Vladimir & Serra, Daniel, 2001.
"Hierarchical location-allocation models for congested systems,"
European Journal of Operational Research,
Elsevier, vol. 135(1), pages 195-208, November.
- Vladimir Marianov & Daniel Serra, 2000. "Hierarchical location-allocation models for congested systems," Economics Working Papers 425, Department of Economics and Business, Universitat Pompeu Fabra.
- Barton H. Hamilton & Vivian Ho & Dana P. Goldman, 2000. "Queuing for Surgery: Is the U.S. or Canada Worse Off?," The Review of Economics and Statistics, MIT Press, vol. 82(2), pages 297-308, May.
- Branas, Charles C. & Revelle, Charles S., 2001. "An iterative switching heuristic to locate hospitals and helicopters," Socio-Economic Planning Sciences, Elsevier, vol. 35(1), pages 11-30, March.
- Vladimir Marianov & Daniel Serra, 1994. "Probabilistic maximal covering location models for congested systems," Economics Working Papers 70, Department of Economics and Business, Universitat Pompeu Fabra.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.