Winner

For each of the twenty instances proposed each participant submits the best solution found by their algorithm in the specified CPU time. The winner must be prepared to show that those results are repeatable in the given computer time. In particular the participants should make their program in such a way that the EXACT run that produced the solution submitted can be repeated (by providing the random seed etc.). Participants who cannot provide feasible solutions to all twenty instances are excluded from the competition. The winner is the participant that reaches the best results across all instances. More precisely for each instance and participant a score between 0 and 1 is calculated as follows: (x-b)/(w-b), where x is the number of soft constraint violations of the participant on this instance, b is the number of soft constraint violations of the best participant on this instance, and w the number of soft constraint violations of the worst participant on this instance. These scores are added up across the 20 instances for each participant resulting in a total score between 0 and 20. The winner is the participant with the lowest score.