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

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 humanprovided 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.

Exploring Instance Generation for Automated Planning

“…Recently, a new approach for fully automated instance generation has been proposed for CP [1,2]. The approach allows users to declaratively describe a CP problem and properties of valid instances in a single CP model using the high-level constraint modelling language essence [4].…”