Local branching relaxation heuristics for integer linear programs

DOI10.1007/978-3-031-33271-5_7MaRDI QIDQ6057251zbMATH OpenOpenAlexFDO

Authors Taoan Huang, Aaron Ferber, Yuandong Tian, Bistra Dilkina, Benoit Steiner

Publication date 4 October 2023

Published in Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2212.08183

zbMATH Keywords

heuristic searchinteger linear programlarge neighborhood search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx) Combinatorial optimization (90C27)

Abstract: Large Neighborhood Search (LNS) is a popular heuristic algorithm for solving combinatorial optimization problems (COP). It starts with an initial solution to the problem and iteratively improves it by searching a large neighborhood around the current best solution. LNS relies on heuristics to select neighborhoods to search in. In this paper, we focus on designing effective and efficient heuristics in LNS for integer linear programs (ILP) since a wide range of COPs can be represented as ILPs. Local Branching (LB) is a heuristic that selects the neighborhood that leads to the largest improvement over the current solution in each iteration of LNS. LB is often slow since it needs to solve an ILP of the same size as input. Our proposed heuristics, LB-RELAX and its variants, use the linear programming relaxation of LB to select neighborhoods. Empirically, LB-RELAX and its variants compute as effective neighborhoods as LB but run faster. They achieve state-of-the-art anytime performance on several ILP benchmarks.

Cites work

• A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
• Adaptive large neighborhood search for mixed integer programming
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• An automatic method for solving discrete programming problems
• An evolutionary algorithm for polishing mixed integer programming solutions
• An Exact Approach to the One-Dimensional Facility Layout Problem
• Combinatorial auctions: a survey
• DINS, a MIP Improvement Heuristic
• Efficient models for the facility layout problem
• Exploring relaxation induced neighborhoods to improve MIP solutions
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Heuristic search viewed as path finding in a graph
• Local branching
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Mixed integer programming: analyzing 12 years of progress
• RENS. The optimal rounding
• Rounding and propagation heuristics for mixed integer programming
• Solving Connected Subgraph Problems in Wildlife Conservation
• Statistical mechanics of complex networks
• The vehicle routing problem

Cited in

(1)

• scientific article; zbMATH DE number 4149896 (Why is no real title available?)

This page was built for publication: Local branching relaxation heuristics for integer linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057251)