Learning Primal Heuristics for Mixed Integer Programs

07/02/2021
by   Yunzhuang Shen, et al.
0

This paper proposes a novel primal heuristic for Mixed Integer Programs, by employing machine learning techniques. Mixed Integer Programming is a general technique for formulating combinatorial optimization problems. Inside a solver, primal heuristics play a critical role in finding good feasible solutions that enable one to tighten the duality gap from the outset of the Branch-and-Bound algorithm (B B), greatly improving its performance by pruning the B B tree aggressively. In this paper, we investigate whether effective primal heuristics can be automatically learned via machine learning. We propose a new method to represent an optimization problem as a graph, and train a Graph Convolutional Network on solved problem instances with known optimal solutions. This in turn can predict the values of decision variables in the optimal solution for an unseen problem instance of a similar type. The prediction of variable solutions is then leveraged by a novel configuration of the B B method, Probabilistic Branching with guided Depth-first Search (PB-DFS) approach, aiming to find (near-)optimal solutions quickly. The experimental results show that this new heuristic can find better primal solutions at a much earlier stage of the solving process, compared to other state-of-the-art primal heuristics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2023

Learning To Dive In Branch And Bound

Primal heuristics are important for solving mixed integer linear program...
research
06/23/2019

Optimal Solution Predictions for Mixed Integer Programs

Mixed Integer Programming (MIP) is one of the most widely used modeling ...
research
07/07/2023

Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization

We introduce Scylla, a primal heuristic for mixed-integer optimization p...
research
03/18/2021

Learning to Schedule Heuristics in Branch-and-Bound

Primal heuristics play a crucial role in exact solvers for Mixed Integer...
research
02/15/2022

Confidence Threshold Neural Diving

Finding a better feasible solution in a shorter time is an integral part...
research
06/04/2022

Design and Implementation of an Heuristic-Enhanced Branch-and-Bound Solver for MILP

We present a solver for Mixed Integer Programs (MIP) developed for the M...
research
08/01/2023

Threshold-aware Learning to Generate Feasible Solutions for Mixed Integer Programs

Finding a high-quality feasible solution to a combinatorial optimization...

Please sign up or login with your details

Forgot password? Click here to reset