Location of multiple server common service centers or public facilities for minimizing general congestion an travel cost functions

The authors propose a model for locating a fixed number of multiple-server service centers or facilities that may become congested. Customers arriving at these centers must wait in line until served. The locations of the facilities and the allocations of customers to them are chosen by the planner, so to minimize both travel costs and system-wide congestion (or queuing) at centers. All the customers arriving at the facilities must be served, up to a certain maximum line length. The travel cost in which customers incur is a function of the length of the trip to the facility, while the congestion cost at a facility is a general function of the number of customers waiting on line or being served at the facility. The resulting model is a nonlinear p-median formulation. A solution method for this nonlinear model is proposed, and computational experience is presented.

[1]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[2]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

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

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

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

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

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

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

[9]  Rajan Batta,et al.  The Maximal Expected Covering Location Problem: Revisited , 1989, Transp. Sci..

[10]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[11]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[12]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[13]  J. G. Klincewicz,et al.  Avoiding local optima in thep-hub location problem using tabu search and GRASP , 1993, Ann. Oper. Res..

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

[15]  G Laporte,et al.  TABU SEARCH ALGORITHMS FOR THE (R/XP)-MEDIANOID AND (R/P)-CENTROID PROBLEMS , 1994 .

[16]  Thomas A. Grossman,et al.  Location with Market Externalities , 1995 .

[17]  Vladimir Marianov,et al.  Siting Emergency Services , 1995 .

[18]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

[20]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[21]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

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

[23]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[24]  M. Dorigo,et al.  The Ant Colony Optimization MetaHeuristic 1 , 1999 .

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

[26]  H. A. Eiselt,et al.  Market Capture Models under Various Customer-Choice Rules , 1999 .

[27]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[28]  Erik Rolland,et al.  Queueing delay guarantees in bandwidth packing , 1999, Comput. Oper. Res..

[29]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[30]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[31]  Vladimir Marianov,et al.  Location of hubs in a competitive environment , 1999, Eur. J. Oper. Res..

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

[33]  Jiamin Wang,et al.  Locating service facilities to reduce lost demand , 2002 .

[34]  J. Sun,et al.  A Parametric Approach for a Nonlinear Discrete Location Problem , 2002, J. Comb. Optim..

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

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

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

[38]  Jared L. Cohon,et al.  Multiobjective programming and planning , 2004 .

[39]  Vladimir Marianov,et al.  Allocating servers to facilities, when demand is elastic to travel and waiting times , 2005, RAIRO Oper. Res..