Structure-Based Primal Heuristics for Mixed Integer Programming

  • Primal heuristics play an important role in the solving of mixed integer programs (MIPs). They help to reach optimality faster and provide good feasible solutions early in the solving process. In this paper, we present two new primal heuristics which take into account global structures available within MIP solvers to construct feasible solutions at the beginning of the solving process. These heuristics follow a large neighborhood search (LNS) approach and use global structures to define a neighborhood that is with high probability significantly easier to process while (hopefully) still containing good feasible solutions. The definition of the neighborhood is done by iteratively fixing variables and propagating these fixings. Thereby, fixings are determined based on the predicted impact they have on the subsequent domain propagation. The neighborhood is solved as a sub-MIP and solutions are transferred back to the original problem. Our computational experiments on standard MIP test sets show that the proposed heuristics find solutions for about every third instance and therewith help to improve the average solving time.

Export metadata

  • Export Bibtex
Author:Gerald Gamrath, Timo Berthold, Stefan Heinz, Michael Winkler
Document Type:Book chapter
Parent Title (English):Optimization in the Real World
First Page:37
Last Page:53
Series:Mathematics for Industry
Publisher:Springer Japan
Year of first publication:2015

$Rev: 13581 $