Some experiments with ant colony algorithms for the exam timetabling problem

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

Volumn 4150 LNCS, Issue , 2006, Pages 492-499

  Eley, Michael ^a  

^a University of Applied Science Aschaffenburg   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SCHEDULING; STUDENTS;

COMBINATORIAL OPTIMIZATION; EXAMS; POWERFUL SOLUTION APPROACH; TIMETABLING PROBLEMS;

GLOBAL OPTIMIZATION;

EID: 33751366290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11839088_50     Document Type: Conference Paper

References (19)

1. Carter, M., Laporte, G., Lee, S.: Examination timetabling algorithmic strategies and applications. Journal of the Operational Research Society 47 (1996) 373-383
2. Garey, M., Johnson, D.: Computers and intractability: a guide to the theory of NP-completness. W. H. Freeman and Company, New York (1979)
3. Carter, M., Laporte, G.: Recent developments in practical examination timetabling. Lecture Notes in Computer Science 1153 (1996) 3-21
4. Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proceedings of the first european conference on artificial life, Amsterdam, Elsevier Science Publishers (1992) 134-142
5. Dorigo, M., Di Caro, G., Gambarella, L.: Ant algorithms for discrete optimization, Artificial Life 5 (1999) 137-172
6. Stützle, T., Hoos, H.: MAX - MIN Ant Systems. Future Generation Computer System 16 (2000) 889-914
7. Socha, K., Sampels, M., Manfrin, M.: Ant algorithms for the university course timetabling problem with regard to state-of-the-art. In: Proceedings of 3rd European Workshop on Evolutionary Computation in Combinatorial Optimization (EvoCOP'2003), Essex, UK (2003) 334-345
8. Costa, D., Hertz, A.: Ants can color graphs. Journal of the Operational Research Society 48 (1997) 295-305
9. Dowsland, K., Thompson, J.: Ant colony optimisation for the examination scheduling problem. Journal of the Operational Research Society 56 (2005) 426-439
10. ftp://ie.utoronto.ca/pub/carter/testprob
11. White, G., Xie, B., Zonjic, S.: Using tabu search with long-term memeory and relaxation to create examination timetables. European Journal of Operational Research 153 (2004) 80-91
12. http://www.or.ms.unimelb.edu.au/timetabling/ttexp2.html.
13. Di Gaspero, L., Schaerf, A.: Tabu search techniques for examination timetabling Lecture Notes in Computer Science 2079 (2001) 104-117
14. Caramia, M., Dell'Olmo, P., Italiano, G.: New algorithms for examination timetabling. Lecture Notes in Computer Science 982 (2001) 230-241
15. Burke, E., Newall, J.: Enhancing timetable solutions with local search methods. Lecture Notes in Computer Science 2740 (2003) 195-206
16. Merlot, L., Boland, N., Hughes, B., Stuckey, P.: New benchmarks for examination timetabling. (Test problem database, http://www.or.ms.unimelb.edu. au/timetabling.html)
17. Di Gaspero, L.: Recolour, shake and kick: A recipe for the examination timetabling problem. In: Proceedings of the fourth international conference on the practice and theory of automated timetabling, Gent, Belgium (2002) 404-407
18. Paquete, L., Stützle, T.: Empirical analysis of tabu search for the lexicographic optimization of the examination timetabling problem. In: Proceedings of the fourth international conference on the practice and theory of automated timetabling, Gent, Belgium (2002) 413-420
19. Casey, S., Thompson, J.: Grasping the examination scheduling problem. Lecture Notes in Computer Science 2740 (2003) 233-244