Shift-and-Propagate

In recent years, there has been a growing interest in the design of general purpose primal heuristics for use inside complete mixed integer programming solvers. Many of these heuristics rely on an optimal LP solution, which may take a significant amount of time to find. In this paper, we address this issue by introducing a pre-root primal heuristic that does not require a previously found LP solution. This heuristic, named Shift-and-Propagate , applies domain propagation techniques to quickly drive a variable assignment towards feasibility. Computational experiments indicate that this heuristic is a powerful supplement to existing rounding and propagation heuristics.

[1]  Fred W. Glover,et al.  General Purpose Heuristics for Integer Programming—Part II , 1997, J. Heuristics.

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

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

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

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

[6]  Wheeler Ruml,et al.  Incomplete Tree Search using Adaptive Probing , 2001, IJCAI.

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

[8]  José Luis González Velarde,et al.  Computing tools for modeling, optimization and simulation : interfaces in computer science and operations research , 2000 .

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

[10]  Timo Berthold.  Heuristics of the Branch-Cut-and-Price-Framework SCIP , 2007, OR.

[11]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

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

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

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

[15]  David L. Woodruff,et al.  Scatter Search to Generate Diverse MIP Solutions , 2000 .

[16]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

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

[18]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[19]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[20]  Jakub Marecek,et al.  Exploiting structure in integer programs , 2012 .

[21]  E. Balas,et al.  Pivot and shift - a mixed integer programming heuristic , 2004, Discret. Optim..

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

[23]  Joachim P. Walser.  Integer Optimization by Local Search , 2000, Lecture Notes in Computer Science.

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

[25]  Egon Balas,et al.  Octane: A New Heuristic for Pure 0-1 Programs , 2001, Oper. Res..

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

[27]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[28]  Joachim Paul Walser,et al.  Integer Optimization by Local Search: A Domain-Independent Approach , 1999 .

[29]  Gautam Mitra,et al.  Analysis of mathematical programming problems prior to applying the simplex algorithm , 1975, Math. Program..

[30]  Erling D. Andersen,et al.  Presolving in linear programming , 1995, Math. Program..

[31]  Fred W. Glover,et al.  Solving zero-one mixed integer programming problems using tabu search , 1998, European Journal of Operational Research.

[32]  José Luis González Velarde,et al.  Computing Tools for Modeling, Optimization and Simulation , 2000 .

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

[34]  Alessandro Zanarini,et al.  Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems , 2012, J. Artif. Intell. Res..

[35]  Tobias Achterberg,et al.  SCIP - a framework to integrate Constraint and Mixed Integer Programming , 2004 .

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

[37]  Louis Anthony Cox,et al.  Wiley encyclopedia of operations research and management science , 2011 .

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

[39]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

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

[41]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[42]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[44]  Fred W. Glover,et al.  General purpose heuristics for integer programming—Part I , 1997, J. Heuristics.

[45]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

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

[47]  Peter Richtárik,et al.  Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design , 2011, OR.

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

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

[50]  Stefan Nickel,et al.  Operations Research, Proceedings 2007, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5-7, 2007 , 2008, OR.

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