Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We extend automatic instance generation methods to allow cross-paradigm comparisons. We demonstrate that it is possible to completely automate the search for benchmark instances that help to discriminate between solvers. Our system starts from a high level human-provided problem specification, which is translated into a specification for valid instances. We use the automated algorithm configuration tool irace to search for instances, which are translated into inputs for both MIP and CP solvers by means of the Conjure, Savile Row, and MiniZinc tools. These instances are then solved by CPLEX and Chuffed, respectively. We constrain our search for instances by requiring them to exhibit a significant advantage for MIP over CP, or vice versa. Experimental results on four optimisation problem classes demonstrate the effectiveness of our method in identifying instances that highlight differences in performance of the two solvers.

Cite

CITATION STYLE

APA

Akgün, Ö., Dang, N., Miguel, I., Salamon, A. Z., Spracklen, P., & Stone, C. (2020). Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12296 LNCS, pp. 41–51). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-58942-4_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free