Solving Multi-Configuration Problems: A Performance Analysis with Choco Solver

TL;DR

This paper explores multi-configuration problems, focusing on generating personalized exams, and analyzes the performance of the Choco Solver in handling such complex constraint satisfaction tasks.

Contribution

It introduces the concept of multi-configuration in practical scenarios and provides a detailed performance analysis of the Choco Solver for these problems.

Findings

Choco Solver's performance varies with problem complexity

Insights into bottlenecks in multi-configuration solving

Guidelines for optimizing solver performance

Abstract

In many scenarios, configurators support the configuration of a solution that satisfies the preferences of a single user. The concept of \emph{multi-configuration} is based on the idea of configuring a set of configurations. Such a functionality is relevant in scenarios such as the configuration of personalized exams, the configuration of project teams, and the configuration of different trips for individual members of a tourist group (e.g., when visiting a specific city). In this paper, we exemplify the application of multi-configuration for generating individualized exams. We also provide a constraint solver performance analysis which helps to gain some insights into corresponding performance issues.