A concurrent processing framework for the set partitioning problem

A scheme for domain decomposition of the set partitioning problem is presented. Similar to the exploitation of special structure to improve algorithm performance, special structure can be exploited to divide the set partitioning problem into smaller subproblems. Real-world set partitioning problems from the airline industry are used to study the potential advantages of solving multiple subproblems to identify optimal solutions. The results of the study show that the decomposition is especially successful when applied to large problems that are difficult when solved using a single processor. For these cases, decomposition was able to produce smaller problems that, in the majority of cases, were far easier to solve than the original problem. Also, optimal solutions were identified in significantly less time than the time taken to solve the original problem. The results suggest that concurrent processing of subproblems should be investigated as an alternative method for solving large set partitioning problems typically encountered in real-world applications.

[1]  Manfred W. Padberg.  Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..

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

[3]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[4]  Lawrence Bodin,et al.  A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles , 1983 .

[5]  Michael Ball,et al.  A Graph Partitioning Approach to Airline Crew Scheduling , 1985, Transp. Sci..

[6]  Agha Iqbal Ali.  Reformulation of the set partitioning problem as apure network with special order set constraints , 1998, Ann. Oper. Res..

[7]  Ira Gershkoff,et al.  Optimizing Flight Crew Schedules , 1989 .

[8]  Gautam Mitra,et al.  Graph theoretic relaxations of set covering and set partitioning problems , 1995 .

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

[10]  David M. Ryan,et al.  The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[11]  D. Ryan,et al.  On the integer properties of scheduling set partitioning models , 1988 .

[12]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[13]  Teodor Gabriel Crainic,et al.  The Column Generation Principle And The Airline Crew Scheduling Problem , 1987 .

[14]  Eric Gelman,et al.  Recent Advances in Crew-Pairing Optimization at American Airlines , 1991 .

[15]  Martin W. P. Savelsbergh,et al.  A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems , 1996, J. Heuristics.

[16]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[17]  Candace A. Yano,et al.  A Multiplier Adjustment Approach for the Set Partitioning Problem , 1992, Oper. Res..

[18]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[19]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[20]  Edward Keefer Baker,et al.  Efficient heuristic solutions for the airline crew scheduling problem , 1979 .

[21]  David Mark Levine,et al.  A parallel genetic algorithm for the set partitioning problem , 1995 .

[22]  Gerald L. Thompson,et al.  The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems , 1994, Comput. Oper. Res..

[23]  J F Barutt,et al.  AIRLINE CREW SCHEDULING : SUPERCOMPUTERS AND ALGORITHMS , 1990 .

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

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

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

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

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

[29]  Hanif D. Sherali,et al.  Tighter Representations for Set Partitioning Problems , 1996, Discret. Appl. Math..