MiniZinc Challenge 2019 Results

CP 2019 presentation slides of the MiniZinc Challenge 2019 will be available here.

Entrants

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

• Choco 4 (description). A Java FD solver.
• iZplus (description).
• JaCoP (description). A Java FD solver.
• OR-Tools (description).
• OscaR/CBLS (description). A constraint-based local search solver written in Scala.
• Picat SAT (description).
• SICStus Prolog (description). A Prolog development environment with a FD constraint programming module.
• sunny-cp^— (description). A variant of sunny-cp only using Choco, Gecode, HaifaCSP, JaCoP, iZplus, MinisatID, Mistral, Opturion CPX, OR-Tools, Picat.
• Yuck (description). A local search solver written in Scala.

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

• Chuffed (description). A C++ FD solver using lazy clause generation.
• Gecode (description). A C++ FD solver.
• MZN/Cbc. Translates to MILP (description), uses Cbc version 2.9.
• MZN/CPLEX. Translates to MILP (description), uses IBM ILOG CPLEX Optimizer version 12.6.0.0.
• sunny-cp (description). A multi-threaded CP portfolio solver using 13 different CP and MIP solvers incl. Chuffed, G12 solvers, Gecode.

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 (Gecode, JaCoP, SICStus Prolog) were automatically included in the free search category, while entries in the free search category (Chuffed, Concrete, OscaR/CBLS, Yuck and promoted FD entries except Gecode) were automatically included in the parallel search category. Lastly, all entries in the parallel search category and promoted entries into that category were automatically included in the open search category.

Summary of Results

The results for the MiniZinc Challenge 2019 are

Category	Gold	Silver	Bronze
Fixed	OR-Tools	JaCoP	SICStus Prolog
Free	OR-Tools	iZplus	Picat SAT
Parallel	OR-Tools	iZplus	Choco 4
Open	OR-Tools	sunny-cp—	iZplus
Local Search	iZplus	Yuck	OscaR/CBLS

Description of Results

All times are given in milliseconds.

A score of 0.0 indicates a worse answer in quality (worse objective, no proof of optimality, or no answer for satisfaction problems), 1.0 a better solution in quality. When the quality is the same, the 1.0 purse is split with respect to time used.

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, -par or -open (for the parallel portfolio solver entered) at the end of the solver 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 indicates that a solution was found,
• C indicates that the search was complete,
• ERR indicates an incorrect answer or the solver aborted,
• ERR indicates that flattening aborted (time-out or out-of-memory),
• UNK indicates that no answer was returned in the time limit.

Download all problems

All problems are available in a zipped tar-ball here.

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:

Plot settings: Note that plotting takes time. Create plots for each instance Time axis scale: Default Linear Log Plot lines shape: Steps Lines Area scoring settings: Normalise

Summary:	Total per problem:
Solver Score Score Incomplete Score Area	Problem Solver Score Score Incomplete Score Area

Individual results:

Problem	Instance	Solver	Status	Time	Objective	Score	Score Incomplete	Score Area

Objective plots for each instance:

Problem	Instance	Plot

Score development over time:

Global constraint per model

The following table lists the global constraints used by each model in this year's challenge. In addition, the columns RC and SBC, respectively, indicate whether the model contains redundant or/and symmetry breaking constraints.

Model	RC	SBC	Global constraints used
accap			diffn
amaze	X		count
code-generator	X	X	alldifferent, cumulative, decreasing, diffn, diffn_nonstrict, maximum, minimum, table, value_precede_chain
fox-geese-corn	X
groupsplitter	X	X	count, table
hrc
kidney-exchange		X	all_different, bin_packing, seq_precede_chain
liner-sf-repositioning			alldifferent, alldifferent_except_0
lot-sizing	X	X	alldifferent, at_least, at_most, global_cardinality
median-string
multi-knapsack			knapsack
nside			cumulative, global_cardinality_low_up
ptv			count
rcpsp-wet-diverse	X		cumulative
rotating-workforce	X	X	global_cardinality_low_up, regular
stack-cuttingstock		X	cumulative
steelmillslab		X	bin_packing_load
stochastic-vrp			circuit
triangular
zephyrus	X	X	lex_greatereq, lex_less

---

The files on this page are for MiniZinc version 2.3.1.