Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers

Abstract : Scheduling a subset of solvers belonging to a given portfolio has proven to be a good strategy when solving Constraint Satisfaction Problems (CSPs). In this paper, we show that this approach can also be effective for Constraint Optimization Problems (COPs). Unlike CSPs, sequential execution of optimization solvers can communicate informa-tion in the form of bounds to improve the performance of the following solvers. We provide a hybrid and flexible portfolio approach that com-bines static and dynamic time splitting for solving a given COP. Empiri-cal evaluations show the approach is promising and sometimes even able to outperform the best solver of the porfolio.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01091664
Contributor : Amadini Roberto <>
Submitted on : Monday, December 8, 2014 - 9:47:34 PM
Last modification on : Saturday, January 27, 2018 - 1:30:55 AM
Long-term archiving on : Monday, March 9, 2015 - 10:15:43 AM

File

timesplit.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Roberto Amadini, Peter J. Stuckey. Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers. Principles and Practice of Constraint Programming (CP 2014), Sep 2014, Lyon, France. pp.108 - 124, ⟨10.1007/978-3-319-10428-7_11⟩. ⟨hal-01091664⟩

Share

Metrics

Record views

180

Files downloads

158