Locating Emergency Services With Priority Rules: The Priority Queuing Covering Location Problem

This file is part of IDEAS, which uses RePEc data

Locating Emergency Services With Priority Rules: The Priority Queuing Covering Location Problem

Author Info

Daniel Serra ()
Francisco Silva

Additional information is available for the following registered author(s):

Francisco José Ferreira Silva

Abstract

One 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 Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

Publisher Info
Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 642.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Sep 2002
Date of revision: May 2008
Handle: RePEc:upf:upfgen:642

Contact details of provider:
Web page: http://www.econ.upf.edu/

For technical questions regarding this item, or to correct its listing, contact: ().

Find related papers by JEL classification:
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - 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)

References listed on IDEAS
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.:

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. [Downloadable!] (restricted)
Vladimir Marianov & Daniel Serra, 2000. "Hierarchical Location-allocation Models for Congested Systems," Economics Working Papers 425, Department of Economics and Business, Universitat Pompeu Fabra. [Downloadable!]
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. [Downloadable!] (restricted)

Full references

Statistics
Access and download statistics

Did you know? About five million pdf files are downloaded through RePEc every year.

This page was last updated on 2010-2-5.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.