The university course timetabling problem with a three-phase approach

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

Volumn 3616 LNCS, Issue , 2005, Pages 109-125

  Kostuch, Philipp ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITION; COMPUTER SIMULATION; CURRICULA; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING; SIMULATED ANNEALING;

METAHEURISTICS NETWORKS; TIMETABLING; UNIVERSITY COURSE TIMETABLING PROBLEM (UCTP); WINNING COMPETITION ENTRY;

PROBLEM SOLVING;

EID: 33645973532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593577_7     Document Type: Conference Paper

References (23)

1. www.idsia.ch/Files/ttcomp2002.
2. Burke, E., Bykov, Y., Newall, J., Petrovic, S.: A Time-Predefined Approach to Course Timetabling. Yugoslav J. Oper. Res. 13 (2003) 139-151
3. Carter, M. W., Johnson, D. G.: Extended Clique Initialisation in Examination Timetabling. J. Oper. Res. Soc. 52 (2001) 538-544
4. Carter, M. W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II (PATAT'97, Selected Papers). Lecture Notes in Computer Science, Vol. 1408. Springer, Berlin (1998) 3-19
5. Carter, M. W., Laporte, G., Chinneck, J. W.: A General Examination Scheduling System. Interfaces. 24 (1994) 109-120
6. Carter, M. W., Laporte, G., Lee, S.-Y.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47 (1996) 373-383
7. Chiarandini, M., Socha, K., Birattari, M., Rossi-Doria, O.: An Effective Hybrid Approach for the University Course Timetabling Problem. Technical Report AIDA-03-05. FG Intellektik, TU Darmstadt (March 2003)
8. Deris, S., Omatu, S., Ohta, H.: Timetable Planning Using the Constraint-Based Reasoning. Comput. Oper. Res. 27 (2000) 819-840
9. de Werra, D.: The Combinatorics of Timetabling. Eur. J. Oper. Res. 96 (1997) 504-513
10. Di Gaspero, L., Schaerf, A.: Tabu Search Techniques for Examination Timetabling. In: Burke, E., Erben, W. (eds.): The Practice and Theory of Automated Timetabling III (PATAT'00, Selected Papers). Lecture Notes in Computer Science, Vol. 2079. Springer, Berlin (2001) 104-117
11. Di Gaspero, L., Schaerf, A.: A Multineighbourhood Local Search Solver for the Timetabling competition TTComp 2002. In: Burke, E. K., Trick, M. (eds.): PATAT 2004 - Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling 475-478
12. Kirkpatrick, S., Gelatt, C. D., Vecchi, M. P.: Optimization by Simulated Annealing. Science 220 (1983) 671-680
13. Paechter, B., Rankin, R. C., Gumming, A., Fogarty, T. C.: Timetabling the Classes of an Entire University with an Evolutionary Algorithm. In: Eiben, A. E., Schoenauer, M., Schwefel, H.-P. (eds.): Parallel Problem Solving From Nature - PPSN V (Amsterdam). Springer, Berlin (1998)
14. Papadimitriou, C. H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1998)
15. Ross, P., Hart, E., Corne, D.: Some Observations About GA-based Exam Timetabling. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II (PATAT'97, Selected Papers). Lecture Notes in Computer Science, Vol. 1408. Springer, Berlin (1998) 115-129
16. Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., Paechter, B.: A Local Search for the Timetabling Problem. In: Burke, E., De Causmaecker, P. (eds.): PATAT 2002 - Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling 124-127
17. Rossi-Doria, O., Sampels, M., Chiarandini, M., Knowles, J., Manfrin, M., Mastrolilli, M., Paquete, L., Paechter, B.: A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. In: Burke, E., De Causmaecker, P. (eds.): Practice and Theory of Automated Timetabling IV (PATAT'02, Selected Papers). Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin (2003) 329-351
18. Schaerf, A.: A Survey of Automated Timetabling. Artif. Intell. Rev. (1999) 87-127
19. Smith, K. A., Abramson, D., Duke, D.: Hopfield Neural Networks for Timetabling: Formulations, Methods, and Comparative Results. Int. J. Comput. Indust. Eng. 44 (2003) 283-305
20. K. Socha, K.: MAX-MIN Ant System for International Timetabling Competition. Technical Report TR/IRIDIA/2003-30. Université Libre de Bruxelles, Belgium (September, 2003)
21. Socha, K., Knowles, J., Sampels, M.: A Max-Min Ant System for the University Timetabling Problem. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.): Proc. ANTS 2002 - 3rd Int. Workshop on Ant Algorithms. Lecture Notes in Computer Science, Vol. 2463. Springer, Berlin (2002) 1-13
22. Thomson, J. M., Dowsland, K. A.: A Robust Simulated Annealing Based Examination Timetabling System. Comput. Oper. Res. 25 (1998) 637-648
23. West, D. B.: Introduction to Graph Theory. 2nd edn. Prentice-Hall, Englewood Cliffs, NJ (2001)