Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem

2011/04/13 by Sara Ceschia, Ceschia, Sara, Luca Di Gaspero +3
Computer Science · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.DM

paper · pdf · doi:10.48550/arxiv.1104.2518

arxiv created 2011/04/13 · arxiv updated 2015/03/18

Abstract

The post-enrolment course timetabling (PE-CTT) is one of the most studied timetabling problems, for which many instances and results are available. In this work we design a metaheuristic approach based on Simulated Annealing to solve the PE-CTT. We consider all the different variants of the problem that have been proposed in the literature and we perform a comprehensive experimental analysis on all the public instances available. The outcome is that our solver, properly engineered and tuned, performs very well on all cases, providing the new best known results on many instances and state-of-the-art values for the others.

Related

• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
• Robustness Approaches for the Examination Timetabling Problem under Data Uncertainty
• A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem
• A hybrid meta-heuristic for the generation of feasible large-scale course timetables using instance decomposition
• Greedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem