Design and statistical analysis of a hybrid local search algorithm for course timetabling

Authors:
Ruggero Bellio;Luca Di Gaspero;Andrea Schaerf
Affiliations:
Dipartimento di Scienze Statistiche, Università di Udine, Udine, Italy 33100;Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università di Udine, Udine, Italy 33100;Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università di Udine, Udine, Italy 33100
Venue:
Journal of Scheduling
Year:
2012

Citing 14
Cited 1

A tabu search heuristic for the vehicle routing problem

Management Science
Tabu Search

Tabu Search
Using Experimental Design to Find Effective Parameter Settings for Heuristics

Journal of Heuristics
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
A simulated annealing approach to the traveling tournament problem

Journal of Scheduling
State-of-the-Art Review: A User's Guide to the Brave New World of Designing Simulation Experiments

INFORMS Journal on Computing
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

Operations Research
Automatic algorithm configuration based on local search

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition

INFORMS Journal on Computing
Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics

SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Tuning the performance of the MMAS heuristic

SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Mixed models for the analysis of local search components

SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
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
Optimal university course timetables and the partial transversal polytope

WEA'08 Proceedings of the 7th international conference on Experimental algorithms

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

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a hybrid local search algorithm for the solution of the Curriculum-Based Course Timetabling Problem and we undertake a systematic statistical study of the relative influence of the relevant features on the performances of the algorithm. In particular, we apply modern statistical techniques for the design and analysis of experiments, such as nearly orthogonal space-filling Latin hypercubes and response surface methods. As a result of this analysis, our technique, properly tuned, compares favorably with the best known ones for this problem.