Skip to main content
SpringerLink
Log in

Tabu Search Techniques for Examination Timetabling

  • Conference paper
  • First Online:
Practice and Theory of Automated Timetabling III (PATAT 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2079))

Abstract

The Examination Timetabling problem regards the scheduling for the exams of a set of universitycourses, avoiding the overlapping of exams having students in common, fairly spreading the exams for the students, and satisfying room capacity constraints.

We present a familyof solution algorithms for a set of variants of the Examination Timetabling problem. The algorithms are based on tabu search, and theyimp ort several features from the research on the Graph Colouring problem.

Our algorithms are tested on both public benchmarks and random instances, and theyare compared with previous results in the literature. The comparison shows that the presented algorithms performs as well as constructive methods and memetic algorithms, and onlya decomposition based approach outperforms them in most cases.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burke, E., Newall, J.: A Multi-stage Evolutionary Algorithm for the Timetable Problem. IEEE Trans. Evol. Comput. 3 (1999) 63–74

    Article  Google Scholar 

  2. Burke, E., Newall, J., Weare R.: A Memetic Algorithm for University Exam Timetabling. In: Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling (1995) 241–250

    Google Scholar 

  3. Carter, M.W.: A Decomposition Algorithm for Practical Timetabling Problems. Working Paper 83-06. Industrial Engineering, University of Toronto (1983)

    Google Scholar 

  4. Carter, M.W., Laporte, G.: Recent Developments in Practical Examination Timetabling. In: Proc. 1st Int. Conf. on the Practice and Theoryof Automated Timetabling (1996) 3–21

    Google Scholar 

  5. Carter, M.W., Laporte, G., Chinneck, J.W.: A General Examination Scheduling System. Interfaces 24 (1994) 109–120

    Google Scholar 

  6. Carter, M.W., Laporte, G., Lee, S.Y.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 74 (1996) 373–383

    Article  Google Scholar 

  7. Corne, D., Fang, H.-L., Mellish, C.: Solving the Modular Exam Scheduling Problem with Genetic Algorithms. Technical Report 622. Department of Artificial Intelligence, Universityof Edinburgh (1993)

    Google Scholar 

  8. Di Gaspero, L., Schaerf, A.: EasyLocal++: An Object-Oriented Framework for Flexible Design of Local Search Algorithms. Technical Report UDMI/13/2000/RR. Dipartimento di Matematica e Informatica, Università di Udine (2000). Available at http://www.diegm.uniud.it/~aschaerf/projects/local++

  9. Garey, M.R., Johnson, D.S.: Computers and Intractability-A Guide to NP completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  10. Gendreau, M., Hertz, A., Laporte, G.: A Tabu Search Heuristic for the Vehicle Routing Problem. Manage. Sci. 40 (1994) 1276–1290

    Article  MATH  Google Scholar 

  11. Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)

    MATH  Google Scholar 

  12. Hertz, A., de Werra, D.: Using Tabu Search Techniques for Graph Coloring. Computing 39 (1987) 345–351

    Article  MATH  MathSciNet  Google Scholar 

  13. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by Simulated Annealing: an Experimental Evaluation. Part II: Graph Coloring and Number Partitioning. Oper. Res. 39 (1991) 378–406

    MATH  Google Scholar 

  14. Laporte, G. Desroches, S.: Examination Timetabling by Computer. Comput. Oper. Res. 11 (1984) 351–360

    Article  Google Scholar 

  15. Mehlhorn, K., Näher, S., Seel, M., Uhrig, C.: The LEDA User Manual. Max Plank Institute, Saarbrücken, Germany(1999). Version 4.0

    Google Scholar 

  16. Morgenstern, C., Shapiro, H.: Coloration Neighborhood Structures for General Graph Coloring. In: 1st Ann. ACM-SIAM Symp. on Discrete Algorithms (1990) 226–235

    Google Scholar 

  17. Schaerf, A.: A Surveyof Automated Timetabling. Artif. Intell. Rev. 13 (1999) 87–127

    Article  Google Scholar 

  18. Stützle, T.: Iterated Local Search for the Quadratic Assignment Problem. Technical Report AIDA-99-03. FG Intellektik, TU Darmstadt (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università degli Studi di Udine, via delle Scienze 208, I-33100, Udine, Italy

    Luca Di Gaspero

  2. Dipartimento di Matematica e Informatica, Università degli Studi di Udine, via delle Scienze 206, I-33100, Udine, Italy

    Andrea Schaerf

Authors
  1. Luca Di Gaspero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Schaerf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Information Technology Automated Scheduling, Optimisation and Planning Research Group, University of Nottingham, Jubilee Campus,Wollaton Road, NG8 1BB, Nottingham, UK

    Edmund Burke

  2. Department of Computer Science, FH Konstanz, University of Applied Science, Brauneggerstr. 55, 78462, Konstanz, Germany

    Wilhelm Erben

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heodelberg

About this paper

Cite this paper

Di Gaspero, L., Schaerf, A. (2001). Tabu Search Techniques for Examination Timetabling. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44629-X_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42421-5

  • Online ISBN: 978-3-540-44629-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation