Paper #642

Title:

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

Authors:

Daniel Serra and Francisco Silva

Date:

September 2002 (Revised: May 2008)

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

JEL codes:

C61, L80

Area of Research:

Operations Management

Published in:

International Journal of Production Research, Vol. 45, N 21, 2007, pp. 5117-5134
With the title:
A Capacitated Facility Location Problem with Constrained Backlogging Probabilities

Download the paper in PDF format