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.  Facility Location Problems with Stochastic Demands and Congestion , 2002 .

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

[3]  S I Harewood,et al.  Emergency ambulance deployment in Barbados: a multi-objective approach , 2002, J. Oper. Res. Soc..

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

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

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

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

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

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

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

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

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

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

[14]  Vladimir Marianov,et al.  PROBABILISTIC MAXIMAL COVERING LOCATION-ALLOCATION FOR CONGESTED SYSTEMS , 1998 .

[15]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[16]  Rajan Batta,et al.  A queueing-location model with expected service time dependent queueing disciplines , 1989 .

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

[18]  RICHARD C. LARSON,et al.  A hypercube queuing model for facility location and redistricting in urban emergency services , 1974, Comput. Oper. Res..

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

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

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

[22]  Michel Gendreau,et al.  A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..

[23]  Marvin B. Mandell,et al.  Covering models for two-tiered emergency medical services systems , 1998 .

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

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

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

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