Locating emergency services with priority rules: The priority queuing covering location problem

Daniel Serra () and Francisco José Silva

Economics Working Papers from Department of Economics and Business, Universitat Pompeu Fabra

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.

Keywords: Location; queuing; greedy heuristics; simulation (search for similar items in EconPapers)
JEL-codes: C61 L80 (search for similar items in EconPapers)
Date: 2002-09, Revised 2008-05
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
https://econ-papers.upf.edu/papers/642.pdf Whole Paper (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:upf:upfgen:642

Access Statistics for this paper

More papers in Economics Working Papers from Department of Economics and Business, Universitat Pompeu Fabra
Bibliographic data for series maintained by ( this e-mail address is bad, please contact ).