Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron

In this paper we consider the well-known fixed-charge transportation problem. To send any flow from source si to destination tj, we incur a unit variable shipping cost of cij and a fixed cost fij. Here we study the structure of the projection polyhedron of this problem, in the space of 0-1 variables associated with fixed charges, and we develop several classes of valid inequalities and derive conditions under which they are facet defining. In some cases, if the conditions are not satisfied, we show how they can be lifted to define facets. Several heuristics for generating and adding these facets are presented. Using these results, we develop a computationally effective algorithm for solving the problem. The computational results clearly indicate the usefulness of this approach.

[1]  Egon Balas,et al.  On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} , 1986, Math. Program..

[2]  Fred W. Glover,et al.  A New Optimization Method for Large Scale Fixed Charge Transportation Problems , 1981, Oper. Res..

[3]  A. Victor Cabot,et al.  Some branch‐and‐bound procedures for fixed‐cost transportation problems , 1984 .

[4]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[6]  Laurence A. Wolsey,et al.  Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..

[7]  Martin W. P. Savelsbergh,et al.  Lifted flow cover inequalities for mixed 0-1 integer programs , 1999, Math. Program..

[8]  H. D. Ratliff,et al.  A branch-and-bound method for the fixed charge transportation problem , 1990 .

[9]  Laurence A. Wolsey,et al.  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.

[10]  Katta G. Murty,et al.  Solving the Fixed Charge Problem by Ranking the Extreme Points , 1968, Oper. Res..

[11]  Daniel E. O'Leary,et al.  Use of penalties in a branch and bound procedure for the fixed charge transportation problem , 1989 .

[12]  Yogesh Kumar Agarwal,et al.  k-Partition-based facets of the network design problem , 2006 .

[13]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[14]  Bruce W. Lamar,et al.  Revised-Modified Penalties for Fixed Charge Transportation Problems , 1997 .

[15]  Alper Atamtürk,et al.  Flow pack facets of the single node fixed-charge flow polytope , 2001, Oper. Res. Lett..

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

[17]  Torbjörn Larsson,et al.  A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem , 1994, Discret. Appl. Math..

[18]  Martin W. P. Savelsbergh,et al.  Sequence Independent Lifting in Mixed Integer Programming , 2000, J. Comb. Optim..

[19]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..