A Hybrid Genetic Algorithm for School Timetabling

  • Peter Wilke
  • Matthias Gröbner
  • Norbert Oster
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2557)

Abstract

Hybrid Genetic Algorithms apply so called hybrid or repair operators or include problem specific knowledge about the problem domain in their mutation and crossover operators. These operators use local search to repair or avoid illegal or unsuitable assignments or just to improve the quality of the solutions already found.

Those Hybrid Genetic Algorithms have been successfully applied to different constraint satisfaction and timetabling problems such as the travelling salesman problem, scheduling problems, employee timetabling or high school timetabling.

In this paper we describe a Genetic Algorithm for solving the German school timetabling problem. The Genetic Algorithm uses direct representation of the problem and applies an adapted mutation operator as well as several specific repair operators. We redecode the computed improvements to the genotype which establishes a kind of Lamarckian evolution. One of the problems utilising these hybrid operators is how and when to apply them, i.e. how to set the parameters right to achieve the best results. Different approaches have been started to adjust these parameters in an optimal way, but in most cases these adjustments require additional computing time and consequently are quite costly. We tackled this problem by an adaptation mechanism for the repair operators which can be applied without additional computing time. These operators are switched on when the normal Genetic Algorithm does not yield any more improvements. When the Genetic Algorithm then converges again, a reconfiguration step for the operator parameters guides the search out of the local optimum.

Keywords

Applications Constraints Evolutionary Algorithms Planning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Bufé et al., “Automated Solution of a Highly Constrained School Timetabling Problem — Preliminary Results”, Proceedings of the EvoWorkshops 2001, ed. E. J. W. Boers et al., pp. 431–440, Springer, 2001.Google Scholar
  2. 2.
    E. Burke and D. Elliman and R. Weare, “Specialised Recombinative Operators for Timetabling Problems”, in Proceedings of the AISB (AI and Simulated Behaviour) Workshop on Evolutionary Computing, pp. 75–85, Springer, 1995.Google Scholar
  3. 3.
    P. Cowling and G. Kendall and E. Soubeiga, “Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation”, Proceedings of the EvoWorkshops 2002, ed. St. Cagnoni et al., pp. 1–10, Springer, 2002.Google Scholar
  4. 4.
    C. Di Stefano and A. G. B. Tettamanzi, “An Evolutionary Algorithm for Solving the School Timetabling Problem”, Proceedings of the EvoWorkshops 2001, ed. E. J. W. Boers et al., pp. 452–462, Springer, 2001.Google Scholar
  5. 5.
    C. Fernandes and J. P. Caldeira and F. Melicio and A. Rosa, “High School Weekly Timetabling by Evolutionary Algorithms”, in Proceedings of 14th Annual Acm Symposium On Applied Computing, San Antonio, Texas, 1999.Google Scholar
  6. 6.
    J. P. Caldeira and A. C. Rosa, “School Timetabling using Genetic Search”, Proceedings of the Second International Conference on the Practice and Theory of Automated Timetabling, 1997.Google Scholar
  7. 7.
    D. E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison-Wesley, Reading, 1989.Google Scholar
  8. 8.
    M. Gröbner and P. Wilke, “Optimizing Employee Schedules by a Hybrid Genetic Algorithm”, Proceedings of the EvoWorkshops 2001, ed. E. J. W. Boers et al., pp. 463–472, Springer, 2001.Google Scholar
  9. 9.
    M. Gröbner and P. Wilke, “A General View on Timetabling Problems”, Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling, ed. E. Burke and P. De Causmaecker pp. 221–227, 2002.Google Scholar
  10. 10.
    E. Lamma and L. M. Pereira and F. Riguzzi, “Belief Revision by Lamarckian Evolution” Proceedings of the EvoWorkshops 2001, ed. E. J. W. Boers et al., pp. 404–413, Springer, 2001.Google Scholar
  11. 11.
    N. Oster, “Stundenplanerstellung für Schulen mit Evolutionären Verfahren”, Thesis, Universität Erlangen-Nürnberg, July 2001.Google Scholar
  12. 12.
    R. Weare and E. Burke and D. Elliman, “A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems”, in Proceedings of the Sixth International Conference on Genetic Algorithms, ed. L. J. Eshelman, pp. 605–610, Pittsburg, Morgan Kaufmann, 1995.Google Scholar
  13. 13.
    D. Whitley and V. S. Gordon and K. Mathias, “Lamarckian Evolution, The Baldwin Effect and Function Optimization”, in Proceedings of the Third International Workshop on Parallel ProblemSolving fromNature, ed.s H.-P. Schwefel and R. Männer, Springer-Verlag, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Peter Wilke
    • 1
  • Matthias Gröbner
    • 2
  • Norbert Oster
    • 2
  1. 1.Centre for Intelligent Information Processing Systems (CIIPS) Dept. of Electrical & Electronic EngineeringThe University of Western AustraliaCrawleyAustralia
  2. 2.Lehrstuhl für Programmiersprachen und ProgrammiermethodikUniversität Erlangen-NürnbergErlangenGermany

Personalised recommendations