IJCAI 2024 Presentation
Image credit:Abstract
The integer linear programming (ILP) problem is a fundamental research topic in operations research, and the local search method is an important class of algorithms for quickly solving many combinatorial optimization problems. With rapidly increasing computing power, parallelism turns out to be a promising approach to enhancing the efficiency of problem-solving. However, rare studies investigate parallel local search algorithms for solving the general ILP problem. We propose the first parallel local search framework (ParaILP) for solving the general ILP problem, based on two novel ideas{:} a new initialization method named polarity initialization to construct different initial solutions for local search threads and a cooperative evolution mechanism for managing and generating high-quality solutions using information shared by different threads. Extensive experiments demonstrate that ParaILP is significantly better than the state-of-the-art academic parallel solvers FiberSCIP and HiGHS, and is competitive with the state-of-the-art commercial parallel solver Gurobi. Experiments are also conducted to analyze the parallelization scalability and the effectiveness of our techniques.
Date
Aug 8, 2023 10:00 AM — 11:00 AM
Event
Location
International Convention Center Jeju (ICC Jeju)
Jeju Island
Click on the Slides button above to view the built-in slides feature.
Slides can be added in a few ways:
- Create slides using Hugo Blox Builder’s Slides feature and link using
slidesparameter in the front matter of the talk file - Upload an existing slide deck to
static/and link usingurl_slidesparameter in the front matter of the talk file - Embed your slides (e.g. Google Slides) or presentation video on this page using shortcodes.
Further event details, including page elements such as image galleries, can be added to the body of this page.
