Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, Tommaso, Urli

TL;DR
This paper introduces a robust simulated annealing approach with a novel parameter tuning methodology for the curriculum-based course timetabling problem, achieving high-quality results on benchmarks and providing new real-world instances for future research.
Contribution
It presents a single-stage simulated annealing method combined with a statistically-principled parameter tuning approach tailored to instance features.
Findings
High-quality results on benchmark instances
Effective parameter tuning methodology
Introduction of new real-world benchmark instances
Abstract
We consider the university course timetabling problem, which is one of the most studied problems in educational timetabling. In particular, we focus our attention on the formulation known as the curriculum-based course timetabling problem, which has been tackled by many researchers and for which there are many available benchmarks. The contribution of this paper is twofold. First, we propose an effective and robust single-stage simulated annealing method for solving the problem. Secondly, we design and apply an extensive and statistically-principled methodology for the parameter tuning procedure. The outcome of this analysis is a methodology for modeling the relationship between search method parameters and instance features that allows us to set the parameters for unseen instances on the basis of a simple inspection of the instance itself. Using this methodology, our algorithm,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
