MiniZinc Challenge 2012 Results

Entrants

The entrants for this year (with their descriptions, when provided):

BProlog (description). A CLP(FD) solver.
Choco (description). A Java FD solver.
Fzn2smt (description). Translates to SMT, uses Yices.
Gecode (description). A C++ FD solver.
izplus (description).
JaCoP (description). A Java FD solver.
Mistral 2.0 (description).
OR-Tools (description).
MinisatID (description).

In addition, the challenge organisers entered the following FlatZinc implementations:

Chuffed (description). A C++ FD solver using Lazy clause generation.
CPX. A C++ FD Solver using Lazy Clause Generation.
G12/FD. A Mercury FD solver (the G12 FlatZinc interpreter's default solver).
G12/LazyFD. A Mercury FD solver using Lazy Clause Generation.
G12/CBC. Translates to MIP, uses Cbc version 2.7.7.
G12/CPLEX. Translates to MIP, uses CPLEX version 12.4.
G12/Gurobi. Translates to MIP, uses Gurobi Optimizer version 5.0.1.

As per the challenge rules, these entries are not eligible for prizes, but do modify the scoring results. Furthermore, entries in the FD search category were automatically included in the free search category, while entries in the free search category (including promoted FD entries) were automatically included in the parallel search category.

Summary of Results

The results for the MiniZinc Challenge 2012 were:

Fixed search:
- Gold medal: Gecode
- Silver medal: Jacop
- Bronze medal: OR-Tools
Free search:
- Gold medal: Gecode
- Silver medal: Fzn2smt
- Bronze medal: izplus
Parallel search:
- Gold medal: Gecode
- Silver medal: Fzn2smt
- Bronze medal: izplus

Description of Results

All times are given in seconds.

Scores of 0, 1 and 2 are used in the tables rather than 0, 0.5 and 1.

If a promoted entry does not recognize an option (or states that it is just ignored), times and solutions from the previous category are used for scoring. The suffixes -fd, -free and -par at the end of the solvers names indicate which configuration the solvers were run with.

mzn2fzn was run with the same time and memory limits as the solvers.

In the Status column:

S and U indicates whether a solution was found (S - Solved) or not (U - Unsolved).
C and U indicates whether the search was complete (C) or uncomplete (U).
E indicates an error of any kind, or an incorrect answer from the solver.

Selection:

Select a list of solvers and benchmarks and click on "Compute Results" to score the solvers against each other on the selected benchmarks. The entrants for each of the fd search, free search and parallel search categories can be selected with the corresponding buttons.

Solver selection:	Problem selection:

Summary:

Total per problem:

Solver	Score

Problem	Solver	Score

Individual results:

Problem	Instance	Solver	Status	Time	Objective	Score

Global constraint per model

The following table lists the global constraints used by each model in this year's challenge.

Model	Global constraints used
amaze	count
amaze2
carpet-cutting	cumulative
fast-food
filters	diffn, maximum
league	count
mspsp	cumulative
nonogram	regular
parity-learning
pattern-set-mining-k1	lex_less
pattern-set-mining-k2	lex_less
project-planning
radiation
ship-schedule
solbat
still-life-wastage
tpp	subcircuit
train
vrp

A gzipped tarball containing all of the problems used in this year's MiniZinc challenge is available here.

The files on this page are for MiniZinc version 1.5.

Back to MiniZinc home page.