Skip to main content
SpringerLink
Log in

Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals

  • Conference paper
Practice and Theory of Automated Timetabling VI (PATAT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3867))

Abstract

In this paper, we first discuss the level of compliance for timetabling research to two important research qualities, namely measurability and reproducibility, analyzing what we believe are the most important contributions in the literature. Secondly, we discuss some practices that, in our opinion, could contribute to the improvement on the two aforementioned qualities for future papers in timetabling research.

For the sake of brevity, we restrict our scope to university timetabling problems (exams, courses, or events), and thus we leave out other equally important timetabling problems, such as high-school, employee, and transportation timetabling.

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. Barr, R., Golden, B., Kelly, J., Resende, M., Stewart, W.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1, 9–32 (1995)

    Article  MATH  Google Scholar 

  2. Birattari, M.: The problem of tuning metaheuristics as seen from a machine learning perspective. Ph.D. Thesis, Université Libre de Bruxelles, Belgium (2004)

    Google Scholar 

  3. Birattari, M.: The RACE Package (April 2005)

    Google Scholar 

  4. Burke, E.K., Newall, J.: A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation 3, 63–74 (1999)

    Article  Google Scholar 

  5. Burke, E.K., Pepper, P., Kingston, J.: A standard data format for timetabling instances. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 213–222. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Carter, M.W.: Carter’s test data (2005) (viewed March 13, 2007) (updated June 7, 2005), ftp://ftp.mie.utoronto.ca/pub/carter/testprob/

  7. Carter, M.W., Laporte, G., Lee, S.Y.: Examination timetabling: algorithmic strategies and applications. Journal of the Operational Research Society 74, 373–383 (1996)

    Article  Google Scholar 

  8. Casey, S., Thompson, J.: Grasping the examination scheduling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 232–244. Springer, Heidelberg (2003)

    Google Scholar 

  9. Chiarandini, M., Birattari, M., Socha, K., Rossi-Doria, O.: An effective hybrid approach for the university course timetabling problem. Journal of Scheduling 9, 403–432 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. The website of graph coloring and its generalization (2004) (viewed March 13, 2007), http://mat.gsia.cmu.edu/COLOR04

  11. Culberson, J.: Graph coloring page (2006) (viewed March 13, 2007) (updated March 31, 2004), http://www.cs.ualberta.ca/~joe/Coloring/

  12. De Causmaecker, P., Demeester, P., Lu, Y., Vanden Berghe, G.: Using Web standards for timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 238–257. Springer, Heidelberg (2003)

    Google Scholar 

  13. Di Gaspero, L., Chiarandini, M., Schaerf, A.: A study on the short-term prohibition mechanisms in tabu search. In: ECAI-2006. Proceedings of the 17th European Conference on Artificial Intelligence, Riva del Garda, Italy, pp. 83–87.

    Google Scholar 

  14. Di Gaspero, L., Fontanel, A., Schaerf, A.: Educational Timetabling @UniUd (2006) (viewed March 13, 2007) (updated May 30, 2006), http://www.diegm.uniud.it/satt/projects/EduTT/

  15. Di Gaspero, L., Schaerf, A.: Tabu search techniques for examination timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 104–117. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Di Gaspero, L., Schaerf, A.: Multi-neighbourhood local search with application to course timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 262–275. Springer, Heidelberg (2003)

    Google Scholar 

  17. Johnson, D.S.: A theoretician’s guide to the experimental analysis of algorithms. In: Goldwasser, M.H., Johnson, D.S., McGeoch, C.C. (eds.) Data Structures, Near Neighbor Searches, and Methodology: 5th and 6th DIMACS Implementation Challenges, pp. 215–250. American Mathematical Society, Providence, RI (2002), available from http://www.research.att.com/~dsj/papers.html

    Google Scholar 

  18. Kingston, J.H.: Modelling timetabling problems with STTL. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 309–321. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Kostuch, P.: The university course timetabling problem with a three-phase approach. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 109–125. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Merlot, L.: Public Exam Timetabling Data Sets (2005) (viewed March 13, 2007) (updated October 13, 2003), http://www.or.ms.unimelb.edu.au/timetabling

  21. Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. Wiley, New York (2005)

    MATH  Google Scholar 

  22. Özcan, E.: Towards an XML-based standard for timetabling problems: TTML. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds.) MISTA 2003. Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 163–185. Springer, Berlin (2005)

    Google Scholar 

  23. Paechter, B., Gambardella, L.M., Rossi-Doria, O.: International Timetabling Competition Webpage (2003) (viewed March 13, 2007) (updated July 10, 2003), http://www.idsia.ch/Files/ttcomp2002/

  24. Qu, R.: The exam timetabling site (2006) (viewed March 13, 2007) (updated July 8, 2006), http://www.cs.nott.ac.uk/~rxq/ETTP.htm

  25. Qu, R., Burke, E.K., McCollum, B., Merlot, L., Lee, S.Y.: The state of the art of examination timetabling. Technical Report NOTTCS-TR-2006-4, School of CSiT, University of Nottingham, UK (2006)

    Google Scholar 

  26. Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardello, L.M., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquette, L., Stützle, T.: A comparison of the performance of different metaheuristics on the timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 329–351. Springer, Heidelberg (2003)

    Google Scholar 

  27. Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review 13, 87–127 (1999)

    Article  Google Scholar 

  28. Socha, K., Knowles, J., Sampels, M.: A MAX-MIN Ant System for the University Timetabling Problem. In: Fieker, C., Kohel, D.R. (eds.) Algorithmic Number Theory. LNCS, vol. 2369, Springer, Heidelberg (2002), Data available from: http://iridia.ulb.ac.be/~msampels/tt.data/

    Google Scholar 

  29. Trick, M.: Challenge Traveling Tournament Instances, web page (2005) (viewed March 13, 2007) (updated October 22, 2006), http://mat.gsia.cmu.edu/TOURN/

  30. The web site of the EURO working group on automated timetabling (WATT) (2002) (viewed March 13, 2007) (updated February 21, 2007), http://www.asap.cs.nott.ac.uk/watt/

  31. Xu, J., Chiu, S., Glover, F.: Fine-tuning a tabu search algorithm with statistical tests. International Transactions on Operational Research 5, 233–244 (1998)

    Article  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

    Andrea Schaerf & Luca Di Gaspero

Authors
  1. Andrea Schaerf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Di Gaspero
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund K. Burke Hana Rudová

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schaerf, A., Di Gaspero, L. (2007). Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77345-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77344-3

  • Online ISBN: 978-3-540-77345-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation