Structure-driven fix-and-propagate heuristics for mixed integer programming

Primal heuristics play an important role in the solving of mixed integer programs (MIPs). They often provide good feasible solutions early and help to reduce the time needed to prove optimality. In this paper, we present a scheme for start heuristics that can be executed without previous knowledge of an LP solution or a previously found integer feasible solution. It uses global structures available within MIP solvers to iteratively fix integer variables and propagate these fixings. Thereby, fixings are determined based on the predicted impact they have on the subsequent domain propagation. If sufficiently many variables can be fixed that way, the resulting problem is solved first as an LP, and then as an auxiliary MIP if the rounded LP solution does not provide a feasible solution already. We present three primal heuristics that use this scheme based on different global structures. Our computational experiments on standard MIP test sets show that the proposed heuristics find solutions for about 60% of the instances and by this, help to improve several performance measures for MIP solvers, including the primal integral and the average solving time.

[1]  Peter J. Stuckey,et al.  Rapid Learning for Binary Programs , 2010, CPAIOR.

[2]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[3]  Matteo Fischetti,et al.  A feasibility pump heuristic for general mixed-integer problems , 2007, Discret. Optim..

[4]  Timo Berthold,et al.  Structure-based primal heuristics for mixed integer programming , 2016 .

[5]  Timo Berthold,et al.  Measuring the impact of primal heuristics , 2013, Oper. Res. Lett..

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

[7]  Shubhashis Ghosh,et al.  DINS, a MIP Improvement Heuristic , 2007, IPCO.

[8]  Matteo Fischetti,et al.  Repairing MIP infeasibility through local branching , 2008, Comput. Oper. Res..

[9]  A. Lodi,et al.  Heuristics in Mixed Integer Programming , 2011 .

[10]  Andrea Lodi.  The Heuristic (Dark) Side of MIP Solvers , 2013, Hybrid Metaheuristics.

[11]  David A. Bader,et al.  Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs , 2018, Comput. Optim. Appl..

[12]  George L. Nemhauser,et al.  A hybrid primal heuristic for finding feasible solutions to mixed integer programs , 2017, Eur. J. Oper. Res..

[13]  Matteo Fischetti,et al.  Feasibility pump 2.0 , 2009, Math. Program. Comput..

[14]  Tobias Achterberg,et al.  Conflict analysis in mixed integer programming , 2007, Discret. Optim..

[15]  Timo Berthold.  Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics , 2015, OR.

[16]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[17]  Andrea Lodi,et al.  Performance Variability in Mixed-Integer Programming , 2013 .

[18]  Tobias Achterberg,et al.  Mixed Integer Programming: Analyzing 12 Years of Progress , 2013 .

[19]  Domenico Salvagnin.  Detecting and Exploiting Permutation Structures in MIPs , 2014, CPAIOR.

[20]  Andrea Lodi,et al.  Mixed Integer Programming Computation , 2010, 50 Years of Integer Programming.

[21]  Tallys H. Yunes,et al.  BDD-based heuristics for binary optimization , 2014, J. Heuristics.

[22]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[23]  M. Padberg,et al.  Degree-two Inequalities, Clique Facets, and Biperfect Graphs , 1982 .

[24]  Timo Berthold,et al.  Four Good Reasons to Use an Interior Point Solver Within a MIP Solver , 2017, OR.

[25]  Sanjay Mehrotra,et al.  Generation of feasible integer solutions on a massively parallel computer using the feasibility pump , 2017, Oper. Res. Lett..

[26]  Martin W. P. Savelsbergh,et al.  Restrict-and-relax search for 0-1 mixed-integer programs , 2013, EURO J. Comput. Optim..

[27]  J. Christopher Beck,et al.  Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling , 2013, CPAIOR.

[28]  John W. Chinneck,et al.  Faster integer-feasibility in mixed-integer linear programs by branching to force change , 2011, Comput. Oper. Res..

[29]  Andrea Lodi,et al.  MIPLIB 2010 , 2011, Math. Program. Comput..

[30]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

[31]  Matteo Fischetti,et al.  Proximity search for 0-1 mixed-integer convex programming , 2014, J. Heuristics.

[32]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

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

[34]  Timo Berthold.  Heuristic algorithms in global MINLP solvers , 2014 .

[35]  Eva K. Lee,et al.  Integer Programming for Telecommunications , 2006, Handbook of Optimization in Telecommunications.

[36]  Timo Berthold.  Primal Heuristics for Mixed Integer Programs , 2006 .

[37]  Martin W. P. Savelsbergh,et al.  Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs , 2017, Eur. J. Oper. Res..

[38]  Robert E. Bixby,et al.  A Brief History of Linear and Mixed-Integer Programming Computation , 2012 .

[39]  Tobias Achterberg,et al.  The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs , 2010, Math. Program. Comput..

[40]  Roland Wunderling,et al.  Paralleler und objektorientierter Simplex-Algorithmus , 1996 .

[41]  Benjamin Müller,et al.  The SCIP Optimization Suite 5.0 , 2017, 2112.08872.

[42]  Chris Wallace.  ZI round, a MIP rounding heuristic , 2010, J. Heuristics.

[43]  Robert E. Bixby,et al.  Presolve Reductions in Mixed Integer Programming , 2020, INFORMS J. Comput..

[44]  Fred W. Glover,et al.  The feasibility pump , 2005, Math. Program..

[45]  Jakob Witzig,et al.  Experiments with Conflict Analysis in Mixed Integer Programming , 2016, CPAIOR.

[46]  Timo Berthold.  RENS: The optimal rounding , 2014 .

[47]  Julien Darlay,et al.  Mathematical Programming Solver Based on Local Search , 2014 .

[48]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[49]  Martin W. P. Savelsbergh,et al.  The mixed vertex packing problem , 2000, Math. Program..

[50]  Timo Berthold,et al.  Rounding and Propagation Heuristics for Mixed Integer Programming , 2011, OR.

[51]  Martin W. P. Savelsbergh,et al.  Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..

[52]  Timo Berthold,et al.  A primal heuristic for MINLP based on sub-MIPs generated by set covering , 2009 .

[53]  François Margot,et al.  Symmetry in Integer Linear Programming , 2010, 50 Years of Integer Programming.

[54]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[55]  Julien Darlay,et al.  Mathematical Programming Solver Based on Local Search: Gardi/Mathematical Programming Solver Based on Local Search , 2014 .

[56]  W. Marsden.  I and J , 2012 .

[57]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[58]  Martin W. P. Savelsbergh,et al.  Conflict graphs in solving integer programming problems , 2000, Eur. J. Oper. Res..

[59]  Pierre Hansen,et al.  Variable neighborhood search and local branching , 2004, Comput. Oper. Res..

[60]  Armin Fügenschuh,et al.  Computational Integer Programming and Cutting Planes , 2005 .

[61]  Alexander Shapiro,et al.  On complexity of multistage stochastic programs , 2006, Oper. Res. Lett..

[62]  Marco Molinaro,et al.  Improving the Randomization Step in Feasibility Pump , 2016, SIAM J. Optim..

[63]  Timo Berthold,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Improving the Feasibility Pump Improving the Feasibility Pump , 2022 .

[64]  Nenad Mladenović,et al.  Variable and single neighbourhood diving for MIP feasibility , 2015 .

[65]  Edward Rothberg,et al.  An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions , 2007, INFORMS J. Comput..

[66]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..