Maximal covering location-allocation problem with M/M/k queuing system and side constraints

We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing centers and locating servers should not exceed a predetermined amount. We present a mathematical model for the problem, and propose a heuristic solution procedure with two local search algorithms for improving the solutions. Finally, some computational results are presented.

[1]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

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

[3]  Oded Berman,et al.  A location model for a facility operating as an M/G/k queue , 1989, Networks.

[4]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[5]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

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

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

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

[9]  Zvi Drezner,et al.  Classroom Note: A note on calculating steady state results for an M/M/k queuing system when the ratio of the arrival rate to the service rate is large , 1998, Adv. Decis. Sci..

[10]  Vladimir Marianov,et al.  A probabilistic quality of service constraint for a location model of switches in ATM communications networks , 2000, Ann. Oper. Res..

[11]  Qian Wang,et al.  Algorithms for a Facility Location Problem with Stochastic Customer Demand and Immobile Servers , 2002, Ann. Oper. Res..

[12]  Roberto Baldacci,et al.  A new method for solving capacitated location problems based on a set partitioning approach , 2002, Comput. Oper. Res..

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

[14]  Vladimir Marianov,et al.  Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times , 2002, Ann. Oper. Res..

[15]  Luiz Antonio Nogueira Lorena,et al.  Local Search Heuristics for Capacitated p-Median Problems , 2003 .

[16]  Vladimir Marianov,et al.  Location models for airline hubs behaving as M/D/c queues , 2003, Comput. Oper. Res..

[17]  Vladimir Marianov,et al.  Location of Multiple-Server Congestible Facilities for Maximizing Expected Demand, when Services are Non-Essential , 2003, Ann. Oper. Res..

[18]  Hassan Shavandi,et al.  A fuzzy queuing location model with a genetic algorithm for congested systems , 2006, Appl. Math. Comput..

[19]  Luiz Antonio Nogueira Lorena,et al.  Hybrid heuristics for the probabilistic maximal covering location-allocation problem , 2007, Oper. Res..

[20]  Zvi Drezner,et al.  The multiple server location problem , 2007, J. Oper. Res. Soc..

[21]  Daniel Serra,et al.  Locating emergency services with different priorities: the priority queuing covering location problem , 2008, J. Oper. Res. Soc..

[22]  Zvi Drezner,et al.  The multiple server center location problem , 2009, Ann. Oper. Res..

[23]  Vladimir Marianov,et al.  Optimal location of multi-server congestible facilities operating as M/Er/m/N queues , 2009, J. Oper. Res. Soc..

[24]  Yi Sun,et al.  A location-allocation problem for a web services provider in a competitive market , 2009, Eur. J. Oper. Res..

[25]  Vladimir Marianov,et al.  Location of single-server immobile facilities subject to a loss constraint , 2010, J. Oper. Res. Soc..