Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem

Authors:
Sara Ceschia;Luca Di Gaspero;Andrea Schaerf
Affiliations:
DIEGM, University of Udine, via delle Scienze 208, I-33100 Udine, Italy;DIEGM, University of Udine, via delle Scienze 208, I-33100 Udine, Italy;DIEGM, University of Udine, via delle Scienze 208, I-33100 Udine, Italy
Venue:
Computers and Operations Research
Year:
2012

Citing 19
Cited 1

Finding a feasible course schedule using Tabu search

Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
A Survey of Automated Timetabling

Artificial Intelligence Review
A MAX-MIN Ant System for the University Course Timetabling Problem

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms

Software—Practice & Experience
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
An effective hybrid algorithm for university course timetabling

Journal of Scheduling
An Extended Implementation of the Great Deluge Algorithm for Course Timetabling

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Electromagnetism-like Mechanism with Force Decay Rate Great Deluge for the Course Timetabling Problem

RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Decomposition, reformulation, and diving in university course timetabling

Computers and Operations Research
ParamILS: an automatic algorithm configuration framework

Journal of Artificial Intelligence Research
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition

INFORMS Journal on Computing
Modeling and solution of a complex university course timetabling problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A clique-based algorithm for constructing feasible timetables

Optimization Methods & Software
Application of the grouping genetic algorithm to university course timetabling

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Design and statistical analysis of a hybrid local search algorithm for course timetabling

Journal of Scheduling
Generalising algorithm performance in instance space: a timetabling case study

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
The university course timetabling problem with a three-phase approach

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Finding Feasible Timetables Using Group-Based Operators

IEEE Transactions on Evolutionary Computation

On the performance of Scatter Search for post-enrolment course timetabling problems

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

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 available public instances. 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.