Integral Column Generation for Set Partitioning Problems with Side Constraints

The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This primal algorithm generates a sequence of integer solutions with decreasing costs, leading to an optimal or near-optimal solution. ICG combines the well-known column generation algorithm and a primal algorithm called the integral simplex using decomposition algorithm (ISUD). In this paper, we develop a generalized version of ICG, denoted ICG, that can solve efficiently large-scale set partitioning problems with side constraints. This new algorithm can handle the side constraints in the reduced problem of ISUD, in its complementary problem or in both components. Computational experiments on instances of the airline crew pairing problem involving up to 1761 constraints show that the latter strategy is the most efficient one and that ICG significantly outperforms two popular column generation heuristics, namely, a restricted master heuristic and a diving heuristic. For the largest tested instance, ICG can produce in less than one hour of computational time more than 500 integer solutions leading to an optimal or near-optimal solution.

[1]  François Soumis,et al.  Airline crew scheduling: models, algorithms, and data sets , 2014, EURO J. Transp. Logist..

[2]  Ruslan Sadykov,et al.  Column Generation based Primal Heuristics , 2010, Electron. Notes Discret. Math..

[3]  Andrea Lodi,et al.  Integral simplex using decomposition with primal cutting planes , 2017, Math. Program..

[4]  François Soumis,et al.  Influence of the normalization constraint on the integral simplex using decomposition , 2017, Discret. Appl. Math..

[5]  François Soumis,et al.  Improved integral simplex using decomposition for the set partitioning problem , 2018, EURO J. Comput. Optim..

[6]  F. Glover AN ALL-INTEGER INTEGER PROGRAMMING ALGORITHM , 1963 .

[7]  Egon Balas,et al.  On the Set-Covering Problem: II. An Algorithm for Set Partitioning , 1972, Oper. Res..

[8]  Andrea Lodi,et al.  Primal cutting plane algorithms revisited , 2002, Math. Methods Oper. Res..

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

[10]  François Soumis,et al.  Dynamic constraint and variable aggregation in column generation , 2014, Eur. J. Oper. Res..

[11]  Guy Desaulniers,et al.  Integral column generation for the set partitioning problem , 2019, EURO J. Transp. Logist..

[12]  Guy Desaulniers,et al.  Multi-phase dynamic constraint aggregation for set partitioning type problems , 2010, Math. Program..

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

[14]  François Soumis,et al.  Improving set partitioning problem solutions by zooming around an improving direction , 2020, Ann. Oper. Res..

[15]  Gerald L. Thompson An Integral Simplex Algorithm for Solving Combinatorial Optimization Problems , 2002, Comput. Optim. Appl..

[16]  Guy Desaulniers,et al.  An Improved Primal Simplex Algorithm for Degenerate Linear Programs , 2007, INFORMS J. Comput..

[17]  Torbjörn Larsson,et al.  Column generation in the integral simplex method , 2009, Eur. J. Oper. Res..

[18]  Torbjörn Larsson,et al.  All-integer column generation for set partitioning: Basic principles and extensions , 2014, Eur. J. Oper. Res..

[19]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[20]  François Vanderbeck,et al.  Implementing Mixed Integer Column Generation , 2005 .

[21]  François Soumis,et al.  Integral Simplex Using Decomposition for the Set Partitioning Problem , 2014, Oper. Res..