Evolutionary non-linear great deluge for university course timetabling

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

Volumn 5572 LNAI, Issue , 2009, Pages 269-276

  Landa Silva, Dario ^a   Obit, Joe Henry ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Course timetabling; Hybrid evolutionary algorithm; Non linear great deluge

Indexed keywords

ASSIGNMENT PROBLEMS; CONSTRAINED PROBLEM; COURSE TIMETABLING; EVOLUTIONARY OPERATORS; EVOLUTIONARY PROCESS; FEASIBLE SOLUTION; GRAPH COLOURING; HYBRID ALGORITHMS; HYBRID EVOLUTIONARY ALGORITHM; NON-LINEAR; NON-LINEAR GREAT DELUGE; STOCHASTIC LOCAL SEARCHES; TIMETABLING; UNIVERSITY COURSE; UNIVERSITY COURSE TIMETABLING-PROBLEMS;

ARTIFICIAL INTELLIGENCE; MATHEMATICAL OPERATORS;

EVOLUTIONARY ALGORITHMS;

EID: 70350680295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02319-4_32     Document Type: Conference Paper

References (14)

1. Abdullah, S., Burke, E.K., McCollum, B.: An Investigation of Variable Neighbourhood Search for University Course Timetabling. In: Proceedings of MISTA 2005: The 2nd Multidisciplinary Conference on Scheduling: Theory and Applications, pp. 413-427 (2005)
2. Abdullah, S., Burke, E.K., McCollum, B.: Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for University Course Timetabling. In: Proceedings of MIC 2005: The 6th Meta-heuristic International Conference, Vienna, Austria, August 22-26 (2005)
3. Abdullah, S., Burke, E.K., McCollum, B.: A Hybrid Evolutionary Approach to the University Course Timetabling Problem. In: Proceedings of CEC 2007: The 2007 IEEE Congress on Evolutionary Computation, pp. 1764-1768 (2007)
4. Abdullah, S., Burke, E.K., McCollum, B.: Using a Randomised Iterative Improvement Algorithm with Composite Neighborhood Structures for University Course Timetabling. In: Metaheuristics - Progress in Complex Systems Optimization, pp. 153-172. Springer, Heidelberg (2007)
5. Asmuni, H., Burke, E.K., Garibaldi, J.: Fuzzy Multiple Heuristic Ordering for Course Timetabling. In: Proceedings of the 5th United Kingdom Workshop on Computational Intelligence (UKCI 2005), pp. 302-309 (2005)
6. Burke, E.K., Bykov, Y., Newall, J., Petrovic, S.: A Time-predefined Approach to Course Timetabling. Yugoslav Journal of Operations Research (YUJOR) 13(2), 139-151 (2003)
7. Burke, E.K., Kendall, G., Soubeiga, E.: A Tabu-search Hyperheuristic for Timetabling and Rostering. Journal of Heuristics 9, 451-470 (2003)
8. Burke, E.K., Eckersley, A., McCollum, B., Petrovic, S., Qu, R.: Hybrid Variable Neighbourhood Approaches to University Exam Timetabling. Technical Report NOTTCS-TR-2006-2, University of Nottingham, School of Computer Science (2006)
9. Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A Graph Based Hyper-Heuristic for Educational Timetabling Problems. European Journal of Operational Research 176, 177-192 (2007)
10. Cooper, T., Kingston, H.: The Complexity of Timetable Construction Problems. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 283-295. Springer, Heidelberg (1996)
11. Dueck, G.: New Optimization Heuristic: The Great Deluge Algorithm and the Record-to-record Travel. Journal of Computational Physics 104, 86-92 (1993)
12. Landa-Silva, D., Obit, J.H.: Great Deluge with Nonlinear Decay Rate for Solving Course Timetabling Problems. In: Proceedings of the 2008 IEEE Conference on Intelligent Systems (IS 2008), pp. 8.11-8.18. IEEE Press, Los Alamitos (2008)
13. Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gam-bardella, L., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., Stuetzle, T.: A Comparion of the Performance of Different Metaheuristics on the Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 333-352. Springer, Heidelberg (2003)
14. Socha, K., Knowles, J., Sampels, M.: A Max-min Ant System for the University Course Timetabling Problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 1-13. Springer, Heidelberg (2002)