Capacitated facility location/network design problems

Abstract We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. We present a mixed integer programming formulation of the problem, and several classes of valid inequalities are derived to strengthen its LP relaxation. Computational experience with problems with up to 40 nodes and 160 candidate links is reported, and a sensitivity analysis provides insight into the behavior of the model in response to changes in key problem parameters.

[1]  Oded Berman,et al.  Optimal Path of a Single Service Unit on a Network to a “Nonemergency” Destination , 1983 .

[2]  David Simchi-Levi.  The Capacitated Traveling Salesman Location Problem , 1991, Transp. Sci..

[3]  Ryuichi Hirabayashi,et al.  The capacitated traveling salesmen location problem , 1994 .

[4]  Mark S. Daskin,et al.  AN INTEGRATED MODEL OF FACILITY LOCATION AND TRANSPORTATION NETWORK DESIGN , 2001 .

[5]  M. John Hodgson,et al.  A network location-allocation model trading off flow capturing andp-median objectives , 1992, Ann. Oper. Res..

[6]  Søren Kruse Jacobsen,et al.  Heuristics for the capacitated plant location model , 1983 .

[7]  David Simchi-Levi,et al.  A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks , 1988, Oper. Res..

[8]  Nicos Christofides,et al.  Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem , 1983 .

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

[10]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[11]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[12]  B. M. Khumawala,et al.  An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

[13]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[14]  Monique Guignard-Spielberg,et al.  A direct dual method for the mixed plant location problem with some side constraints , 1979, Math. Program..

[15]  Mark S. Daskin,et al.  Joint Location/Sizing Maximum Profit Covering Models , 1991 .

[16]  Thomas L. Magnanti,et al.  Decomposition methods for facility location problems , 1986 .

[17]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[18]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[19]  Avijit Ghosh,et al.  Spatial analysis and location-allocation models , 1987 .

[20]  G. Laporte,et al.  EXACT SOLUTION OF A STOCHASTIC LOCATION PROBLEM BY AN INTEGER L-SHAPED ALGORITHM , 1990 .

[21]  Gilbert Laporte,et al.  Exact Solution to a Location Problem with Stochastic Demands , 1994, Transp. Sci..

[22]  Mark S. Daskin,et al.  LOCATION, DISPATCHING AND ROUTING MODELS FOR EMERGENCY SERVICES WITH STOCHASTIC TRAVEL TIMES , 1984 .