A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem

We present a branch-and-cut algorithm to solve the single commodity uncapacitated fixed charge network flow problem, which includes the Steiner tree problem, uncapacitated lot-sizing problems, and the fixed charge transportation problem as special cases. The cuts used are simple dicut inequalities and their variants. A crucial problem when separating these inequalities is to find the right cut set on which to generate the inequalities. The prototype branch-and-cut system, bc-nd includes a separation heuristic for the dicut inequalities, and problem specific primal heuristics, branching and pruning rules. Computational results show that bc-nd is competitive compared to a variety of special purpose algorithms for problems with explicit flow costs. We also examine how general purpose MIP systems perform on such problems when provided with formulations that have been tightened a priori with dicut inequalities.

[1]  Linus Schrage,et al.  Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming , 1985, Oper. Res..

[2]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

[3]  Laurence A. Wolsey,et al.  Uncapacitated lot-sizing: The convex hull of solutions , 1984 .

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

[5]  Laurence A. Wolsey,et al.  bc–opt: a branch-and-cut code for mixed integer programs , 1999, Math. Program..

[6]  J. MacGregor Smith,et al.  Solving to optimality the uncapacitated fixed-charge network flow problem , 1998 .

[7]  Geraldo Robson Mateus,et al.  Solving to optimality the uncapacitated fixed-charge network flow problem , 1998, Comput. Oper. Res..

[8]  R. Bixby An Updated Mixed Integer Programming Library MIPLIB , 1998 .

[9]  Minghe Sun,et al.  A tabu search heuristic procedure for the fixed charge transportation problem , 1998, Eur. J. Oper. Res..

[10]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[11]  Arie Segev,et al.  Analysis of a flow problem with fixed charges , 1989, Networks.

[12]  L. Wolsey,et al.  Valid inequalities and separation for uncapacitated fixed charge networks , 1985 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Laurence A. Wolsey,et al.  Cutting planes in integer and mixed integer programming , 2002, Discret. Appl. Math..

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

[16]  Laurence A. Wolsey,et al.  Algorithms and reformulations for lot sizing problems , 1994, Combinatorial Optimization.

[17]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[18]  Rakesh Nagi,et al.  Design of material flow networks in manufacturing facilities , 1995 .

[19]  J. E. Beasley An SST-based algorithm for the steiner problem in graphs , 1989, Networks.

[20]  M. R. Rao,et al.  Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..

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

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

[23]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

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

[25]  Thorsten Koch,et al.  Solving Steiner tree problems in graphs to optimality , 1998, Networks.

[26]  Panos M. Pardalos,et al.  A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure , 1999, Oper. Res. Lett..

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

[28]  M. W. Cooper,et al.  A branch and bound method for the fixed charge transportation problem , 1970 .