Variable neighbourhood decomposition search for 0-1 mixed integer programs

In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable neighbourhood search with a general-purpose CPLEX MIP solver. We perform systematic hard variable fixing (or diving) following the variable neighbourhood search rules. The variables to be fixed are chosen according to their distance from the corresponding linear relaxation solution values. If there is an improvement, variable neighbourhood descent branching is performed as the local search in the whole solution space. Numerical experiments have proven that exploiting boundary effects in this way considerably improves solution quality. With our approach, we have managed to improve the best known published results for 8 out of 29 instances from a well-known class of very difficult MIP problems. Moreover, computational results show that our method outperforms the CPLEX MIP solver, as well as three other recent most successful MIP solution methods.

[1]  Fred Glover.  Adaptive Memory Projection Methods for Integer Programming , 2005 .

[2]  Saïd Hanafi,et al.  New convergent heuristics for 0-1 mixed integer programming , 2009, Eur. J. Oper. Res..

[3]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[4]  Ramesh Sharda,et al.  Metaheuristic Optimization via Memory and Evolution , 2005 .

[5]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[6]  O. J. Dunn.  Multiple Comparisons among Means , 1961 .

[7]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[8]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[9]  Christophe Wilbaut,et al.  Heuristiques hybrides pour la résolution de problèmes en variables 0-1 mixtes. (Hybrid heuristics for 0-1 mixed integer programming) , 2006 .

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

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

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

[13]  Abraham P. Punnen,et al.  Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem , 2009, Discret. Optim..

[14]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[15]  A. Fréville,et al.  Tabu search: global intensification using dynamic programming , 2006 .

[16]  Saïd Salhi,et al.  Integrating heuristic information into exact methods: The case of the vertex p-centre problem , 2010, J. Oper. Res. Soc..

[17]  R. Iman,et al.  Approximations of the critical region of the fbietkan statistic , 1980 .

[18]  M. Friedman.  A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings , 1940 .

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

[20]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

[22]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[23]  Snežana Mitrović-Minić,et al.  Very large-scale variable neighborhood search for the generalized assignment problem , 2008 .

[24]  A. L. Soyster,et al.  Zero-one programming with many variables and few constraints , 1978 .

[25]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[26]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..