An LP-based heuristic for two-stage capacitated facility location problems

In this paper, a linear programming based heuristic is considered for a two-stage capacitated facility location problem with single source constraints. The problem is to find the optimal locations of depots from a set of possible depot sites in order to serve customers with a given demand, the optimal assignments of customers to depots and the optimal product flow from plants to depots. Good lower and upper bounds can be obtained for this problem in short computation times by adopting a linear programming approach. To this end, the LP formulation is iteratively refined using valid inequalities and facets which have been described in the literature for various relaxations of the problem. After each reoptimisation step, that is the recalculation of the LP solution after the addition of valid inequalities, feasible solutions are obtained from the current LP solution by applying simple heuristics. The results of extensive computational experiments are given.

[1]  Khalil S. Hindi,et al.  Computationally Efficient Solution of a Multiproduct, Two-Stage Distribution—Location Problem , 1994 .

[2]  Pierre Hansen,et al.  A Plant and Warehouse Location Problem , 1977 .

[3]  L. V. Wassenhove,et al.  A survey of algorithms for the generalized assignment problem , 1992 .

[4]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[5]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[6]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[7]  B. Fleischmann.  Designing distribution systems with transport economies of scale , 1993 .

[8]  Manfred Padberg,et al.  On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..

[9]  Karen Aardal,et al.  On the Two-Level Uncapacitated Facility Location Problem , 1996, INFORMS J. Comput..

[10]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

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

[12]  R. Sridharan.  A Lagrangian heuristic for the capacitated plant location problem with single source constraints , 1993 .

[13]  Karen Aardal,et al.  Reformulation of capacitated facility location problems:How redundant information can help , 1998, Ann. Oper. Res..

[14]  Gérard Cornuéjols,et al.  Some facets of the simple plant location polytope , 1982, Math. Program..

[15]  Ulrich Derigs,et al.  Operations Research Proceedings 1996 , 1997 .

[16]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

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

[18]  R. Sridharan.  The capacitated plant location problem , 1995 .

[19]  Karen Aardal,et al.  Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..

[20]  Li-Lian Gao,et al.  Uncapacitated facility location: General solution procedure and computational experience , 1994 .

[21]  K. Jörnsten,et al.  Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing , 1990 .

[22]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[23]  Stefan Wittmann,et al.  Locating Depots for a Food Producer by Solving Uncapacitated Facility Location Problems , 1997 .

[24]  D. Chinhyung Cho,et al.  On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..

[25]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[26]  D. Tcha,et al.  A branch-and-bound algorithm for the multi-level uncapacitated facility location problem , 1984 .

[27]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[28]  E. Powell Robinson,et al.  A dual-based optimization procedure for the two-echelon uncapacitated facility location problem , 1992 .