Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times

Recently, the authors have formulated new models for the location of congested facilities, so to maximize population covered by service with short queues or waiting time. In this paper, we present an extension of these models, which seeks to cover all population and includes server allocation to the facilities. This new model is intended for the design of service networks, including health and EMS services, banking or distributed ticket-selling services. As opposed to the previous Maximal Covering model, the model presented here is a Set Covering formulation, which locates the least number of facilities and allocates the minimum number of servers (clerks, tellers, machines) to them, so to minimize queuing effects. For a better understanding, a first model is presented, in which the number of servers allocated to each facility is fixed. We then formulate a Location Set Covering model with a variable (optimal) number of servers per service center (or facility). A new heuristic, with good performance on a 55-node network, is developed and tested.

[1]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

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

[3]  G. Cornuéjols,et al.  A comparison of heuristics and relaxations for the capacitated plant location problem , 1991 .

[4]  Kenneth E. Rosing,et al.  An Empirical Investigation of the Effectiveness of a Vertex Substitution Heuristic , 1997 .

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

[6]  Oded Berman,et al.  The Stochastic Queue p-Median Problem , 1987, Transp. Sci..

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

[8]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[9]  K. E. Rosing,et al.  The p-Median and its Linear Programming Relaxation: An Approach to Large Problems , 1979 .

[10]  Gerard Rushton,et al.  Strategies for Solving Large Location-Allocation Problems by Heuristic Methods , 1992 .

[11]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[12]  Oded Berman,et al.  Optimal 2-Facility Network Districting in the Presence of Queuing , 1985, Transp. Sci..

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

[14]  P. S. Davis,et al.  A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[15]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[16]  H. Pirkul,et al.  The Maximal Covering Location Problem with Capacities on Total Workload , 1991 .

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

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

[19]  R. Swain.  A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems , 1974 .

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

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

[22]  Oded Berman,et al.  Location-allocation on congested networks , 1986 .

[23]  J. Current,et al.  Capacitated Covering Models , 1988 .

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

[25]  Charles S. ReVelle,et al.  The Maximum Availability Location Problem , 1989, Transp. Sci..

[26]  C. Revelle.  Facility siting and integer-friendly programming , 1993 .

[27]  R. D. Galvão.  THE USE OF LAGRANGEAN RELAXATION IN THE SOLUTION OF UNCAPACITATED FACILITY LOCATION PROBLEMS. , 1993 .

[28]  Mark S. Daskin,et al.  A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .

[29]  Vladimir Marianov,et al.  The Queueing Maximal availability location problem: A model for the siting of emergency vehicles , 1996 .

[30]  C. Revelle,et al.  A Reliability-Constrained Siting Model with Local Estimates of Busy Fractions , 1988 .

[31]  Rajan Batta,et al.  Single Server Queueing-Location Models with Rejection , 1988, Transp. Sci..

[32]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..