A Multiplier Adjustment Approach for the Set Partitioning Problem

We introduce an effective branch-and-bound algorithm for solving the set partitioning problem. The new algorithm employs a new multiplier-adjustment-based bounding procedure, and a complementary branching strategy which results in relatively small search trees. Computational results based on 20 moderately sized crew scheduling problems indicate that our new algorithm is on average 16.6 times faster than the popular code, SETPAR. The improvements are mainly due to the bounding procedure, which is fast, easy to use, and provides tight lower bounds. On average, the bounds are 97.6% of the optimal objective value of the linear programming relaxation after only five iterations, and 98.5% after ten iterations. Moreover, the lower bounds are observed to be monotonically nondecreasing. We also apply the technique of variable elimination, which is very effective in reducing the size of the problems. On average, 89% of the variables are eliminated from the problem at the root node.

[1]  Dennis J. Sweeney,et al.  A Method of Decomposition for Integer Programs , 1979, Oper. Res..

[2]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[3]  J. F. Pierce.  Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems , 1968 .

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

[5]  Javier Etcheberry,et al.  The Set-Covering Problem: A New Implicit Enumeration Algorithm , 1977, Oper. Res..

[6]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .

[7]  J. F. Pierce,et al.  Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems , 1973 .

[8]  Harvey M. Salkin,et al.  Integer Programming , 2019, Engineering Optimization Theory and Practice.

[9]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[10]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[11]  D. H. Marks,et al.  An Analysis of Private and Public Sector Location Models , 1970 .

[12]  P. Michaud.  Exact implicit enumeration method for solving the set partitioning problem , 1972 .

[13]  H. Thuve.  Frequency planning as a set partitioning problem , 1981 .

[14]  Roy E. Marsten,et al.  Crew Planning at Flying Tiger: A Successful Application of Integer Programming , 1979 .

[15]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

[16]  George L. Nemhauser,et al.  The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..

[17]  Dennis J. Sweeney,et al.  Branch and Bound Methods for Multi-Item Scheduling , 1981, Oper. Res..

[18]  Thomas Justin Chan.  A multiplier - adjustment - based branch - and - bound algorithm for solving the set partitioning problem , 1987 .

[19]  James G. Root.  An Application of Symbolic Logic to a Selection Problem , 1964 .