A Constructive Evolutionary Approach to School Timetabling
This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. The problem is modeled as a bi-objective problem used as a basis to construct feasible assignments of teachers to classes on specified timeslots. A new representation for the timetabling problem is presented. Pairs of teachers and classes are used to form conflict-free clusters for each timeslot. Teacher preferences and the process of avoiding undesirable waiting times between classes are explicitly considered as additional objectives. Computational results over real test problems are presented.
KeywordsCluster Problem Soft Constraint Timetabling Problem Feasible Assignment Automate Timetabling
Unable to display preview. Download preview PDF.
- 2.Carter M.W.; Laporte G.: Recent developments in practical course timetabling. In Carter M.W.; Burke E.K. (eds.) Lecture Notes in Computer Science 1408. Springer-Verlag, Berlin (1998) 3–19.Google Scholar
- 3.Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review. n.13 (1999) 87–127.Google Scholar
- 5.Neufeld, G.A.; Tartar, J.: Graph coloring conditions for existence of the solution to the timetabling problem. Communications of the ACM. n. 17 v.8 (1974).Google Scholar
- 6.Coloni A.; Dorigo, M.; Maniezzo, V.: Metaheuristics for high school timetabling. Computational Optimization and Applications. n.9 (1998) 275–298.Google Scholar
- 7.Dowsland K.A.: Simulated annealing solutions for multi-objective scheduling and timetabling. In Modern Heuristic Search Methods. Wiley, Chichester, England (1996) 155–166.Google Scholar
- 9.Burke E.K.; Elliman D.G.; Weare R.F.: A hybrid genetic algorithm for highly constrained timetabling problems. In Larry J. Eshelman (ed.) Genetic Algorithms: Proceedings of the 6th Internation Conference, San Francisco. Morgan Kaufmann. (1995) 605–610.Google Scholar
- 11.Corne D.; Ross P.; Fang H.: Fast practical evolutionary time-tabling. In Fogarty T.C. (ed.) Lecture Notes in Computer Science 865. Springer-Verlag, Berlin (1994) 250–263.Google Scholar
- 12.Holland, J.H.: Adaptation in natural and artificial systems. MIT Press (1975) 11–147.Google Scholar
- 14.Lorena, L.AN. and Furtado, J.C.: Constructive Genetic Algorithms for Clustering Problems. Evolutionary Computation-to appear (2000). Available from http://www.lac.inpe.br/~lorena/cga/cga_clus.PDF.