Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
From MaRDI portal
Publication:342121
DOI10.1016/J.COR.2015.07.002zbMATH Open1349.90316arXiv1409.7186OpenAlexW2962959752MaRDI QIDQ342121FDOQ342121
Sara Ceschia, Luca Di Gaspero, Ruggero Bellio, Tommaso Urli, Andrea Schaerf
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1409.7186
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonparametric statistical methods
- Random forests
- Optimization by Simulated Annealing
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- A branch-and-cut procedure for the Udine course timetabling problem
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- ITC2007 solver description: a hybrid approach
- Adaptive tabu search for course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- Fairness in academic course timetabling
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Curriculum-based course timetabling with SAT and MaxSAT
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- A supernodal formulation of vertex colouring with applications in course timetabling
- Decomposition, reformulation, and diving in university course timetabling
- A new lower bound for curriculum-based course timetabling
- An overview of curriculum-based course timetabling
- Answer set programming as a modeling language for course timetabling
Cited In (17)
- Practices in timetabling in higher education institutions: a systematic review
- An overview of curriculum-based course timetabling
- 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
- Comments on: ``An overview of curriculum-based course timetabling
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- Solving a multiobjective professional timetabling problem using evolutionary algorithms at Mandarine Academy
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- A new model for curriculum-based university course timetabling
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
- Robust university course timetabling problem subject to single and multiple disruptions
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- Simulated annealing with penalization for university course timetabling
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
- Educational timetabling: problems, benchmarks, and state-of-the-art results
- A simulated annealing algorithm for university course timetabling considering travelling distances
Uses Software
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)
