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

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.

[1]  C. Batson,et al.  Improving on‐time performance in health care organizations: a case study , 1999, Health Care Management Science.

[2]  Dana P. Goldman,et al.  Queuing for Surgery: Is the U.S. or Canada Worse Off? , 2000, Review of Economics and Statistics.

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

[4]  Vladimir Marianov,et al.  Hierarchical location-allocation models for congested systems , 2001, Eur. J. Oper. Res..

[5]  R. Faure,et al.  Introduction to operations research , 1968 .

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

[7]  Mark S. Daskin,et al.  Network and Discrete Location , 1995 .

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

[9]  M. Malek,et al.  Setting priorities in health care , 1994 .

[10]  F. Hayes-Roth,et al.  OFFICE OF NAVAL RESEARCH , 2022 .

[11]  Lajos Takács,et al.  Priority queues , 2019, The Art of Multiprocessor Programming.

[12]  Vladimir Marianov,et al.  Location Problems in the Public Sector , 2002 .

[13]  N. K. Jaiswal,et al.  Priority queues , 1968 .

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

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

[16]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

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

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

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

[20]  Kurt M. Bretthauer,et al.  A Model for Planning Resource Requirements in Health Care Organizations , 1998 .

[21]  D. Serra,et al.  Probabilistic maximal covering location models for congested systems , 1994 .

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

[23]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

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

[25]  K. Carriere,et al.  Waiting times for surgical procedures. , 1999, Medical care.

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

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