Measurability and reproducibility in university timetabling research: Discussion and proposals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3867 LNCS, Issue , 2006, Pages 40-49

  Schaerf, Andrea ^a   Di Gaspero, Luca ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EDUCATION; PROBLEM SOLVING; SCHEDULING; SOCIETIES AND INSTITUTIONS;

TIMETABLING PROBLEMS; TRANSPORTATION TIMETABLING; UNIVERSITY TIMETABLING PROBLEMS;

ENGINEERING RESEARCH;

EID: 38549163602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (31)

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)
2. Birattari, M.: The problem of tuning metaheuristics as seen from a machine learning perspective. Ph.D. Thesis, Université Libre de Bruxelles, Belgium (2004)
3. Birattari, M.: The RACE Package (April 2005)
4. Burke, E.K., Newall, J.: A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation 3, 63-74 (1999)
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)
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)
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)
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)
10. The website of graph coloring and its generalization (2004) (viewed March 13, 2007), http://mat.gsia.emu.edu/C0L0R04
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)
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.
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)
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)
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
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)
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)
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)
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)
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)
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)
27. Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review 13, 87-127 (1999)
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/
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)