Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Werra D.: An introduction to timetabling. European Journal of Operations Research. 19 (1985) 151–162.
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.
Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review. n.13 (1999) 87–127.
Tripathy, A.: School timetabling: A case in large binary integer linear programming. Management Science, 30(12) (1984) 1473–1489.
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).
Coloni A.; Dorigo, M.; Maniezzo, V.: Metaheuristics for high school timetabling. Computational Optimization and Applications. n.9 (1998) 275–298.
Dowsland K.A.: Simulated annealing solutions for multi-objective scheduling and timetabling. In Modern Heuristic Search Methods. Wiley, Chichester, England (1996) 155–166.
Hertz A.: Tabu search for large scale timetabling problems. European Journal of Operations Research, 54 (1991) 39–47.
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.
Burke E.K.; Newall J.P.; Weare R.F.: Initialization strategies and diversity in evolutionary timetabling. Evolutionary Computation 6(1) (1998) 81–103.
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.
Holland, J.H.: Adaptation in natural and artificial systems. MIT Press (1975) 11–147.
Michalewicz Z.: Genetic Algorithms + Data Structures = Evolution Programs. 3rd edn. Springer Verlag, Berlin Heidelberg New York (1996).
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filho, G.R., Lorena, L.A.N. (2001). A Constructive Evolutionary Approach to School Timetabling. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive