Skip to main content
SpringerLink
Log in

Comparison of metaheuristic algorithms for Examination Timetabling Problem

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

SA, TS, GA and ACS are four of the main algorithms for solving challenging problems of intelligent systems. In this paper we consider Examination Timetabling Problem that is a common problem for all universities and institutions of higher education. There are many methods to solve this problem, In this paper we use Simulated Annealing, Tabu Search, Genetic Algorithm and Ant Colony System in their basic frameworks for solving this problem and compare results of them with each other.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. J. A. Welsh and M. B. Powel,An Upper bound for the Charomatic Number of a Graph and Its Application to Timetabling Problems, Comp. Jrnl10 (1967), 85–86.

    Article  MATH  Google Scholar 

  2. R. M. Karp,Reducibility among combinatorial Problems, In Complexity of computer computations, Plenum Press, New York, 1972.

    Google Scholar 

  3. M. W. Carter,A survey of practical applications of Examination Timetabling Algorithms, Operation Research34(2) (1986), 193–202.

    Article  Google Scholar 

  4. M. W. Carter, G. Laporte and S. Y. Lee,Examination Timetabling: Algorithmic Strategies and Applications, Journal of the Operational Research Society47 (1996), 373–383.

    Article  Google Scholar 

  5. M. Cangalovic and J. A. M. Schreuder,Exact Colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, European Journal of Operational Research51 (1991), 248–258.

    Article  MATH  Google Scholar 

  6. D. C. Rich,A smart Genetic Algorithm for University Timetabling, The practic and theory of automatedtimetabling, Lecture Notes in Computer Science, eds. E. Burke and P. Ross. Springer1153 (1996), 181–196.

  7. A. Colorni, M. Dorigo and V. Maniezzo,Genetic Algorithms: A New Approach to the Timetabling Problem, The practic and theory of automated timetabling, Lecture Notes in Computer Science, eds. E. Burke and P. Ross. Springer1153 (1996), 235–239.

  8. W. Erben and J. Keppler,A genetic Algorithm Solving a Weekly Course-Timetabling Problem, The practic and theory of automated timetabling, Lecture Notes in Computer Science, eds. E. Burke and P. Ross. Springer1153 (1996), 198–211.

    Google Scholar 

  9. L. Chambers,Practical hand book of Genetic Algorithms: Applications, CRC, Press 1999, Vol. 1, Chapter 8. Dave Corne, Peter Ross, Hsiao-Lan Fang, 219–274.

  10. L. F. Paquete and C. M. Fonseca,A study of Examination Timetabling with Multiobjective Evolutionary Algorithms, MIC 2001-4th mataheuristic International Conference. Porto, Portugal, July 16–20, 2001.

  11. A. S. Asratian and D. de Werra,A generalized class-teacher model fo some timetabling problems, European Journal of Operational Research143 (2002), 531–542.

    Article  MATH  MathSciNet  Google Scholar 

  12. O. Rossi-Doria, Ch. Blum, J. Knowels, M. Sampels, K. Socha and B. Paechter,A Local Search for the Timetabling Problem, Technical Report No. TR/IRIDIA/2002-16, July 2002.

  13. E. K. Burke, Y. Bykov, J. Newall and S. Petrovic,A Time-Predefined Local Search Approach to Exam Timetabling Problems, Computer Science Technical Report No. NOTTCSTR-2001-6.

  14. E. K. Burke, Y. Bykov, J. P. Newall and S. Petrovic,A new Local Search Approach with Execution Time as an Input Parameter, Computer Science Technical Report No. NOTTCS-TR-2002-3.

  15. J. M. Thompson and K. A. Dowsland,A Robust Simulated Annealing Based Examination Timetabling System, Computers and Operations Researchs25 (7/8) (1998), 637–648.

    Article  MATH  Google Scholar 

  16. A. Hertz,Tabu search for large scale timetabling problems, European Journal of Operational Research54 (1991), 39–47.

    Article  MATH  Google Scholar 

  17. L. Di Gaspero and A. Schaerf,Tobu Search Techniques for Examination Timetabling, Third International Conference Patat 2000, Lecture Notes in Computer Science2079 (2000), 104ff.

    Article  Google Scholar 

  18. K. Socha, J. Knowles and M. Sampels,A Max-Min Ant System for the University Course Timetabling Problem, Proceedings of ANTS 2002-Third International workshop on Ant Algorithms, Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany2463 (2002), 1–13 (Also Technical Report/TR/IRIDIA/2002-18).

    Google Scholar 

  19. J. Wood and D. Whitaker,Student centred school timetabling, Journal of the Operational Research Society49 (1998), 1146–1152.

    Article  MATH  Google Scholar 

  20. V. A. Bardadym,Computer-Aided School and University Timetabling: The New Wave, Lecture Notes in Computer Science1153 (1996), 22–45.

    Google Scholar 

  21. S. Deris, S. Omatu and H. Ohta,Timetable planning using the constraint-based reasoning, Computer & Operations Research27 (2000), 819–840.

    Article  MATH  Google Scholar 

  22. E. K. Burke and S. Petrovic,Recent research directions in automated timetabling, European Journal of Operational Research140 (2002), 266–280.

    Article  MATH  Google Scholar 

  23. S. Kirckpatric, Jr. C. Gellat and M. Vecchi,Optimization by simulated annealing, Science220 (1983), 671–680.

    Article  MathSciNet  Google Scholar 

  24. V. Gerny,A Termodynamical approach to the traveling salseman problem: an efficient simulation algorithm, Journal of Optimization Theory Application45 (1985), 41–51.

    Article  Google Scholar 

  25. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller,Equation of state calculations by fast computing machines, Journal of Chemical Physics21 (1953), 1087–1092.

    Article  Google Scholar 

  26. V. P. Laarhoven and E. Aarts,Simulated Annealing: Theory and Practic, Dordrecht: Kluwer Academic Publishers, The Netherlands, 1987.

    Google Scholar 

  27. E. Aarts and J. Korst,Simulated annealing and Boltamann machines, Chichester: Wiley, 1989.

    Google Scholar 

  28. N. Collins, R. Eglese and B. Golden,Simulated annealing an annotated bibliography, American Journal of Mathematical and Management Science8 (1988), 209–307.

    MATH  MathSciNet  Google Scholar 

  29. R. W. EgleseSimulated Annealing: A tool for Operational Research, European Journal of Operational Research46 (1990), 271–281.

    Article  MATH  MathSciNet  Google Scholar 

  30. F. Glover,The general emploee scheduling problem: an integration of management science and artifical intelligence, Computers and Operation Research15 (1986), 563–593.

    Article  MathSciNet  Google Scholar 

  31. F. Glover and M. Laguna,Tabu search, Kluwer academic Publishers, 1997.

  32. K. E. Rosing, C. S. ReVelle, E. Rolland, D. A. Schilling and J. R. Current,Heuristic concentration and Tabu Search: A head to head comparison, European Journal of Operational Research104 (1998), 93–99.

    Article  MATH  Google Scholar 

  33. R. L. Haupt and S. E. Haupt,Practical Genetic Algorithms, A Wiley-interscience publication, John Wiley and sons, INC, NEW YORK, 1997.

    Google Scholar 

  34. M. Dorigo, V. Maniezzo and A. Colorni,Positive feedback as a search strategy, Technical Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, IT, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Ferdowsi University, Mashhad, Iran

    Zahra Naji Azimi

Authors
  1. Zahra Naji Azimi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zahra Naji Azimi.

Additional information

Zahra Naji Azimi received her BS in Applied Mathematics from Ferdowsi University of Mashhad, Iran, She is a member of Young Research Club of Iran, She works on Optimization problems and Simulation. Her research interests focus on new metaheuristic and heuristic methods in Operations Research, Simulation, Computer Science and Management.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Azimi, Z.N. Comparison of metaheuristic algorithms for Examination Timetabling Problem. JAMC 16, 337–354 (2004). https://doi.org/10.1007/BF02936173

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02936173

AMS Mathematics Subject Classification

Key words and phrases

Search

Navigation