A new modeling and solution approach for the set-partitioning problem

The set-partitioning problem (SPP) is widely known for both its application potential and its computational challenge. This NP-hard problem is known to pose considerable difficulty for classical solution methods such as those based on LP technologies. In recent years, the unconstrained binary quadratic program has proven to perform well as a unified modeling and solution framework for a variety of IP problems. In this paper we illustrate how this unified framework can be applied to SPP. Computational experience is presented, illustrating the attractiveness of the approach.

[1]  F. Glover,et al.  Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs , 1999 .

[2]  F. Glover,et al.  Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .

[3]  Mark W. Lewis,et al.  Using xQx to model and solve the uncapacitated task allocation problem , 2005, Oper. Res. Lett..

[4]  Martin W. P. Savelsbergh,et al.  A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems , 2001, INFORMS J. Comput..

[5]  Guy Desaulniers,et al.  Dynamic Aggregation of Set-Partitioning Constraints in Column Generation , 2003, Oper. Res..

[6]  John E. Beasley,et al.  Constraint Handling in Genetic Algorithms: The Set Partitioning Problem , 1998, J. Heuristics.

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

[8]  H. Donald Ratliff,et al.  A Graph-Theoretic Equivalence for Integer Programs , 1973, Oper. Res..

[9]  Fred W. Glover,et al.  A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..

[10]  Srini Ramaswamy,et al.  Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching , 2001, Comput. Optim. Appl..

[11]  R. Borndörfer,et al.  Aspects of Set Packing, Partitioning, and Covering , 1998 .

[12]  Richard M. Karp,et al.  The Differencing Method of Set Partitioning , 1983 .

[13]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[14]  P. Merz,et al.  Memetic algorithms for the unconstrained binary quadratic programming problem. , 2004, Bio Systems.

[15]  James P. Kelly,et al.  A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem , 1999, INFORMS J. Comput..

[16]  Pierre Hansen,et al.  Constrained Nonlinear 0-1 Programming , 1989 .

[17]  Fred W. Glover,et al.  An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem , 2005, Ann. Oper. Res..

[18]  Richard E. Korf,et al.  A Complete Anytime Algorithm for Number Partitioning , 1998, Artif. Intell..

[19]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[20]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[21]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[22]  Thomas A. Feo,et al.  Randomized methods for the number partitioning problem , 1996, Comput. Oper. Res..

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

[24]  Pasquale Avella,et al.  Solving a fuel delivery problem by heuristic and exact approaches , 2004, Eur. J. Oper. Res..

[25]  Toby Walsh,et al.  Analysis of Heuristics for Number Partitioning , 1998, Comput. Intell..

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

[27]  Gintaras Palubeckis,et al.  Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem , 2004, Ann. Oper. Res..

[28]  Peter L. Hammer,et al.  Boolean Methods in Operations Research and Related Areas , 1968 .

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

[30]  P. Hansen.  Methods of Nonlinear 0-1 Programming , 1979 .