A Standard Framework for Timetabling Problems

When timetabling experts are faced with a new timetabling problem, they usually develop a very specialised and optimised solution for this new underlying problem. One disadvantage of this strategy is that even slight changes of the problem description often cause a complete redesign of data structures and algorithms. Furthermore, other timetabling problems cannot be fit to the data structures provided. To avoid this, we have developed a standardised framework which can describe arbitrary timetabling problems such as university timetabling, examination timetabling, school timetabling, sports timetabling or employee timetabling. Thus, a general timetabling language has been developed which enables the definition of resources, events and constraints. Furthermore, we provide a way to apply standard problem solving methods such as branch-and-bound or genetic algorithms to timetabling problems defined by means of the general timetabling language. These algorithms can be improved by problem-specific user-defined hybrid operators. In this paper we present a generalised view on timetabling problems from which we derive our timetabling framework. The framework implementation and its application possibilities are shown with some concrete examples. The paper concludes with some preliminary results and an outlook.

[1]  Patrice Boizumault,et al.  Building University Timetables Using Constraint Logic Programming , 1995, PATAT.

[2]  Tim Fischer,et al.  Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results , 2001, EvoWorkshops.

[3]  Edmund K. Burke,et al.  A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems , 1995, ICGA.

[4]  Edmund K. Burke,et al.  A Standard Data Format for Timetabling Instances , 1997, PATAT.

[5]  Amnon Meisels,et al.  Experiments on Networks of Employee Timetabling Problems , 1997, PATAT.

[6]  Peter Ross,et al.  The Phase-Transition Niche for Evolutionary Algorithms in Timetabling , 1995, PATAT.

[7]  Agostinho C. Rosa,et al.  School Timetabling using Genetic Search , 1997 .

[8]  Mark Wallace,et al.  Constraint logic programming for scheduling and planning , 1995 .

[9]  Matthias Gröbner,et al.  Optimizing Employee Schedules by a Hybrid Genetic Algorithm , 2001, EvoWorkshops.

[10]  Jeffrey H. Kingston.  Modelling Timetabling Problems with STTL , 2000, PATAT.

[11]  Jeffrey H. Kingston.  A User ’ s Guide to the STTL Timetabling Language Version 1 . 0 , 1999 .

[12]  Agostinho C. Rosa,et al.  High school weekly timetabling by evolutionary algorithms , 1999, SAC '99.

[13]  Marco Dorigo,et al.  Genetic Algorithms and Highly Constrained Problems: The Time-Table Case , 1990, PPSN.

[14]  Edmund K. Burke,et al.  Specialised Recombinative Operators for Timetabling Problems , 1995, Evolutionary Computing, AISB Workshop.

[15]  David Corne,et al.  Evolutionary Timetabling: Practice, Prospects and Work in Progress , 1994 .