A Constructive Evolutionary Approach to School Timetabling

  • Geraldo Ribeiro Filho
  • Luiz Antonio Nogueira Lorena
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)


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.


Cluster Problem Soft Constraint Timetabling Problem Feasible Assignment Automate Timetabling 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    de Werra D.: An introduction to timetabling. European Journal of Operations Research. 19 (1985) 151–162.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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. 3.
    Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review. n.13 (1999) 87–127.Google Scholar
  4. 4.
    Tripathy, A.: School timetabling: A case in large binary integer linear programming. Management Science, 30(12) (1984) 1473–1489.CrossRefzbMATHGoogle Scholar
  5. 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. 6.
    Coloni A.; Dorigo, M.; Maniezzo, V.: Metaheuristics for high school timetabling. Computational Optimization and Applications. n.9 (1998) 275–298.Google Scholar
  7. 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
  8. 8.
    Hertz A.: Tabu search for large scale timetabling problems. European Journal of Operations Research, 54 (1991) 39–47.CrossRefzbMATHGoogle Scholar
  9. 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
  10. 10.
    Burke E.K.; Newall J.P.; Weare R.F.: Initialization strategies and diversity in evolutionary timetabling. Evolutionary Computation 6(1) (1998) 81–103.CrossRefGoogle Scholar
  11. 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. 12.
    Holland, J.H.: Adaptation in natural and artificial systems. MIT Press (1975) 11–147.Google Scholar
  13. 13.
    Michalewicz Z.: Genetic Algorithms + Data Structures = Evolution Programs. 3rd edn. Springer Verlag, Berlin Heidelberg New York (1996).CrossRefzbMATHGoogle Scholar
  14. 14.
    Lorena, L.AN. and Furtado, J.C.: Constructive Genetic Algorithms for Clustering Problems. Evolutionary Computation-to appear (2000). Available from

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Geraldo Ribeiro Filho
    • 1
  • Luiz Antonio Nogueira Lorena
    • 2
  1. 1.UMC/INPEMogi das CruzesBrazil
  2. 2.LAC/INPEBrazil

Personalised recommendations