On the Two-Level Uncapacitated Facility Location Problem

We study the two-level uncapacitated facility location (TUFL) problem. Given two types of facilities, which we call y-facilities and z-facilities, the problem is to decide which facilities of both types to open, and to which pair of y- and z-facilities each client should be assigned, in order to satisfy the demand at maximum profit. We first present two multi-commodity flow formulations of TUFL and investigate the relationship between these formulations and similar formulations of the one-level uncapacitated facility location (UFL) problem. In particular, we show that all nontrivial facets for UFL define facets for the two-level problem, and derive conditions when facets of TUFL are also facets for UFL. For both formulations of TUFL, we introduce new families of facets and valid inequalities and discuss the associated separation problems. We also characterize the extreme points of the LP-relaxation of the first formulation. While the LP-relaxation of a multi-commodity formulation provides good bounds in general, the number of variables and constraints grows rapidly with the size of the problem instance. An alternative model of TUFL is a single-commodity fixed-charge network flow problem. Rardin and Wolsey showed that by projecting a so-called multi-commodity extended formulation of fixed-charge network flow problems onto the space of flow variables used in the weaker flow formulation, a broad class of valid inequalities can be obtained. We discuss a subclass of these inequalities for TUFL that seems particularly useful for computational purposes.

[1]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[2]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[3]  G. Nemhauser,et al.  On the Uncapacitated Location Problem , 1977 .

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

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

[6]  Karen Aardal On the Solution of One and Two-Level Capacitated Facility Location Problems by the Cutting Plane Approach , 1992 .

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

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

[9]  Stephen C. Graves,et al.  A composite algorithm for a concave-cost network flow problem , 1989, Networks.

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

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

[12]  M. Guignard Fractional vertices, cuts and facets of the simple plant location problem , 1980 .

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

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

[15]  A. I. Barros,et al.  A general model for the uncapacitated facility and depot location problem , 1994 .

[16]  Laurence A. Wolsey,et al.  Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems , 1993 .