An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems

Author
Keywords
Abstract
In the context of Constraint Programming, a portfolio approach exploits the complementary strengths of a portfolio of different constraint solvers. The goal is to predict and run the best solver(s) of the portfolio for solving a new, unseen problem. In this work we reproduce, simulate, and evaluate the performance of different portfolio approaches on extensive benchmarks of Constraint Satisfaction Problems. Empirical results clearly show the benefits of portfolio solvers in terms of both solved instances and solving time.
Year of Publication
2016
Journal
International Journal of Interactive Multimedia and Artificial Intelligence
Volume
3
Issue
Regular Issue
Number
7
Number of Pages
81-86
Date Published
06/2016
ISSN Number
1989-1660
Citation Key
URL
http://www.ijimai.org/journal/sites/default/files/files/2016/05/ijimai20163_7_12_pdf_13932.pdf
DOI
10.9781/ijimai.2016.3712
Attachment