Comparison of algorithms solving school and course time tabling problems using the erlangen advanced time tabling system (EATTS)

PATAT 2010 - Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling

Volumn , Issue , 2010, Pages 427-439

  Wilke, Peter ^a   Killer, Helmut ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

EATTS; Erlangen advanced time tabling system; Genetic algorithms; Great deluge; Harmony search; Immune system; Real world problems; Simulated annealing; Tabu search

Indexed keywords

EATTS; GREAT DELUGE; HARMONY SEARCH; REAL-WORLD PROBLEM; TIME TABLING;

ALGORITHMS; GENETIC ALGORITHMS; IMMUNE SYSTEM; SCHEDULING; SIMULATED ANNEALING; TABU SEARCH;

PROBLEM SOLVING;

EID: 79952748961     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. [ABKG08] Mohammed Azmi Al-Betar, Ahamad Tajudin Khader, and Taufiq Abdul Gani. A harmony search algorithm for university course timetabling. 2008.
2. [BBNP04] Edmund Burke, Yuri Bykov, James Newall, and Sanja Petrovic. A timeprede fined local search approach to exam timetabling problems. 2004.
3. [BM10] E. Burke and Barry McCollum, editors. Lecture Notes in Computer Science. Springer-Verlag, 2010.
4. [BT95a] Tobias Blickle and Lothar Thiele. A comparison of selection schemes used in genetic algorithms. TIK-Report, 11, 1995.
5. [BT95b] Tobias Blickle and Lothar Thiele. A mathematical analysis of tournament selection. Genetic Algorithms: Proceedings of the 6th International Conference, 1995.
6. [CP95] E. Cantu-Paz. A summary of research on parallel genetic algorithms. Technical Report 95007 IlliGAL Report, 1995.
7. [FSAPMV08] Juan Frausto-Solis, Federico Alonso-Pecina, and Jaime Mora-Vargas. An efi- cient simulated annealing algorithm for feasible solutions of course timetabling. In MICAI 2008: Advances in Artificial Intelligence, volume 5317 of Lecture Notes in Computer Science, pages 675-685. Springer Berlin/Heidelberg, 2008. ISBN 978-3-540-88635-8.
8. [GD91] David E. Goldberg and Kalyanmoy Deb. A comparative analysis of selection schemes used in genetic algorithms. Foundations of Genetic Algorithms, pages 69-93, 1991.
9. [Gee09] Zong Woo Geem, editor. Music-Inspired Harmony Search Algorithm: Theory and Applications. 2009.
10. [Gol89] D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
11. [GS01] Luca Di Gaspero and Andrea Schaerf. Tabu search techniques for examination timetabling. In Practice and Theory of Automated Timetabling III, volume 2079 of Lecture Notes in Computer Science, pages 104-117. Springer Berlin/Heidelberg, 2001. ISBN 978-3-540-42421-5.
12. [Hel04] Sabine Helwig. Erweiterung eines frameworks fur zeitplanungsprobleme. Master's thesis, Universitat Erlangen-Nurnberg, 2004.
13. [KH05] Graham Kendall and Naimah Mohd Hussin. An investigation of a tabu-searchbased hyper-heuristic for examination timetabling. In Multidisciplinary Scheduling: Theory and Applications, pages 309-328. Springer US, 2005. ISBN 978-0- 387-25266-7 (Print) 978-0-387-27744-8 (Online).
14. [Kil09] Helmut Killer. Entwurf und implementierung von algorithmen fur zeitplanungsprobleme. Master's thesis, Universitat Erlangen-Nurnberg, Germany, 2009.
15. [MFD07] M. Mahdavi, M. Fesanghary, and E. Damangir. An improved harmony search algorithm for solving optimization problems. 2007.
16. [MKM06] Muhammad Rozi Malim, Ahamad Tajudin Khader, and Adli Mustafa. Artificial immune algorithms for university timetabling. 2006.
17. [Sys91] G. Syswerda. A study of reproduction in generational and steady-state genetic algorithms. Foundations of Genetic Algorithms, pages 94-101, 1991.
18. [vL87] Peter J.M. van Laarhoven. Simulated annealing. D. Reidel Publishing Company, 1987.
19. [Whi89] Darrell Whitley. The genitor algorithm and selection pressure. Proceedings of the Third International Conference on Genetic Algorithms, pages 116-121, 1989.
20. [Wil10] Peter Wilke. The Erlangen Advanced Time Tabling System (EATTS). In Burke and McCollum [BM10], page submitted.
21. [WK10] Peter Wilke and Helmut Killer. Walk Up Jump Down - A new Hybrid Algorithm for Time Tabling Problems. In Burke and McCollum [BM10], page submitted.