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.002zbMath1349.90316arXiv1409.7186OpenAlexW2962959752MaRDI QIDQ342121
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)
Full work available at URL: https://arxiv.org/abs/1409.7186
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (15)
A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem ⋮ Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 ⋮ Feature-based tuning of single-stage simulated annealing for examination timetabling ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ Simulated annealing with penalization for university course timetabling ⋮ 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 ⋮ Practices in timetabling in higher education institutions: a systematic review ⋮ Robust university course timetabling problem subject to single and multiple disruptions ⋮ A new model for curriculum-based university course timetabling ⋮ Comments on: ``An overview of curriculum-based course timetabling ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem ⋮ An overview of curriculum-based course timetabling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Fairness in academic course timetabling
- A new lower bound for curriculum-based course timetabling
- Curriculum-based course timetabling with SAT and MaxSAT
- A supernodal formulation of vertex colouring with applications in course timetabling
- Decomposition, reformulation, and diving in university course timetabling
- 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
- An overview of curriculum-based course timetabling
- Adaptive tabu search for course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Answer set programming as a modeling language for course timetabling
- Random forests
This page was built for publication: Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
