Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
From MaRDI portal
Publication:342121
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, despite its apparent simplicity, has been able to achieve high quality results on a set of popular benchmarks. A final contribution of the paper is a novel set of real-world instances, which could be used as a benchmark for future comparison.
Recommendations
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- A simulated annealing algorithm for university course timetabling considering travelling distances
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
Cites work
- scientific article; zbMATH DE number 5829047 (Why is no real title available?)
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- A branch-and-cut procedure for the Udine course timetabling problem
- A new lower bound for curriculum-based course timetabling
- A supernodal formulation of vertex colouring with applications in course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- Adaptive tabu search for course timetabling
- An overview of curriculum-based course timetabling
- Answer set programming as a modeling language for course timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Curriculum-based course timetabling with SAT and MaxSAT
- Decomposition, reformulation, and diving in university course timetabling
- Fairness in academic course timetabling
- ITC2007 solver description: a hybrid approach
- Nonparametric statistical methods
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by simulated annealing
- Random forests
- Setting the research agenda in automated timetabling: the second international timetabling competition
Cited in
(18)- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- Practices in timetabling in higher education institutions: a systematic review
- Comments on: ``An overview of curriculum-based course timetabling
- Robust university course timetabling problem subject to single and multiple disruptions
- Solving a multiobjective professional timetabling problem using evolutionary algorithms at Mandarine Academy
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- A new model for curriculum-based university course timetabling
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
- An overview of curriculum-based course timetabling
- A simulated annealing algorithm for university course timetabling considering travelling distances
- Simulated annealing with penalization for university course timetabling
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- Educational timetabling: problems, benchmarks, and state-of-the-art results
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
This page was built for publication: Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342121)
