Solving the International Timetabling Competition: a Deterministic Approach

Authors:
Oscar Chá/vez-Bosquez;Pilar Pozos-Parra;Florian Lengyel
Affiliations:
(Correspd.) Department of Informatics and Systems, University of Tabasco, Carretera Cunduacá/n - Jalpa Km. 1, Tabasco, Mexico. oscar.chavez@ujat.mx/ pilar.pozos@ujat.mx;Department of Informatics and Systems, University of Tabasco, Carretera Cunduacá/n - Jalpa Km. 1, Tabasco, Mexico. oscar.chavez@ujat.mx/ pilar.pozos@ujat.mx;Department of Computer Science, The Graduate Center, CUNY, 365 Fifth Ave., New York, USA. flengyel@gc.cuny.edu
Venue:
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Year:
2011

Citing 5
Cited 0

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
An effective hybrid algorithm for university course timetabling

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

INFORMS Journal on Computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Course Timetabling Problem consists of the weekly scheduling of lectures of a collection of university courses, subject to certain constraints. The International Timetabling Competitions, ITC-2002 and ITC-2007, have been organized with the aim of creating a common formulation for comparison of solution proposals. This paper discusses the design and implementation of an extendable family of sorting-based mechanisms, called Sort Then Fix (STF) algorithms. ITC-2002 and ITC-2007 Post Enrolment based Course Timetabling problem instances were used in this study. The STF approach is deterministic, and does not require swapping or backtracking. Almost all solutions run in less than 10% of the ITC-2002 and less than 2% of the ITC-2007 benchmark times, respectively.