Locating Emergency Services with Different Priorities: The Priority Queuing Covering Location Problem

Previous covering models for emergency service consider all the calls to be of the same importance and impose the same waiting time constraints independently of the service's priority. This type of constraint is clearly inappropriate in many contexts. For example, in urban medical emergency services, calls that involve danger to human life deserve higher priority over calls for more routine incidents. A realistic model in such a context should allow prioritizing the calls for service. In this paper a covering model which considers different priority levels is formulated and solved. The model heritages its formulation from previous research on Maximum Coverage Models and incorporates results from Queuing Theory, in particular Priority Queuing. The additional complexity incorporated in the model justifies the use of a heuristic procedure.

[1]  Oded Berman,et al.  Approximating performance measures for public services , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  Oded Berman,et al.  Facility Location Problems with Stochastic Demands and Congestion , 2002 .

[3]  Margaret L. Brandeau,et al.  A center location problem with congestion , 1992, Ann. Oper. Res..

[4]  R. Church,et al.  Closest assignment constraints and location models: Properties and structure , 1996 .

[5]  Michael O. Ball,et al.  A Reliability Model Applied to Emergency Service Vehicle Location , 1993, Oper. Res..

[6]  J. Goldberg.  Operations Research Models for the Deployment of Emergency Services Vehicles , 2004 .

[7]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[8]  C. Revelle,et al.  The queuing probabilistic location set covering problem and some extensions , 1994 .

[9]  C. Revelle,et al.  Central Facilities Location under an Investment Constraint , 2010 .

[10]  Amedeo R. Odoni,et al.  A single-server priority queueing-location model , 1988, Networks.

[11]  Vladimir Marianov,et al.  Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems , 1998 .

[12]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[13]  Vedat Verter,et al.  Location of Preventive Health Care Facilities , 2002, Ann. Oper. Res..

[14]  Charles ReVelle,et al.  An iterative switching heuristic to locate hospitals and helicopters , 2001 .

[15]  Rajan Batta,et al.  The stochastic queue center problem , 1999, Comput. Oper. Res..

[16]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[17]  Rajan Batta,et al.  Covering-Location Models for Emergency Situations That Require Multiple Response Units , 1990 .

[18]  Oded Berman,et al.  Optimal Server Location on a Network Operating as an M/G/1 Queue , 1985, Oper. Res..

[19]  Mauricio G. C. Resende,et al.  Computing Approximate Solutions of the Maximum Covering Problem with GRASP , 1998, J. Heuristics.

[20]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..