Automatic Construction of Parallel Portfolios via Explicit Instance Grouping

04/17/2018
by   Shengcai Liu, et al.
0

Simultaneously utilizing several complementary solvers is a simple yet effective strategy for solving computationally hard problems. However, manually building such solver portfolios typically requires considerable domain knowledge and plenty of human effort. As an alternative, automatic construction of parallel portfolios (ACPP) aims at automatically building effective parallel portfolios based on a given problem instance set and a given rich design space. One promising way to solve the ACPP problem is to explicitly group the instances into different subsets and promote a component solver to handle each of them.This paper investigates solving ACPP from this perspective, and especially studies how to obtain a good instance grouping.The experimental results showed that the parallel portfolios constructed by the proposed method could achieve consistently superior performances to the ones constructed by the state-of-the-art ACPP methods,and could even rival sophisticated hand-designed parallel solvers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2015

DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability

The most successful parallel SAT and MaxSAT solvers follow a portfolio a...
research
03/29/2017

Experience-based Optimization: A Coevolutionary Approach

This paper studies improving solvers based on their past solving experie...
research
05/29/2022

A Framework for Generating Informative Benchmark Instances

Benchmarking is an important tool for assessing the relative performance...
research
11/17/2022

Automatic Construction of Parallel Algorithm Portfolios for Multi-objective Optimization

It has been widely observed that there exists no universal best Multi-ob...
research
08/10/2021

Parallel Computation of Combinatorial Symmetries

In practice symmetries of combinatorial structures are computed by trans...
research
05/02/2023

Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learning

Solving Constrained Horn Clauses (CHCs) is a fundamental challenge behin...
research
07/28/2021

Automated Design of Heuristics for the Container Relocation Problem

The container relocation problem is a challenging combinatorial optimisa...

Please sign up or login with your details

Forgot password? Click here to reset