A tabu-based memetic approach for examination timetabling problems

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

Volumn 6401 LNAI, Issue , 2010, Pages 574-581

  Abdullah, Salwani ^a   Turabieh, Hamza ^a   McCollum, Barry ^b   McMullan, Paul ^b  

^a UNIVERSITI KEBANGSAAN MALAYSIA   (Malaysia)

^b QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

Examination Timetabling; Memetic Algorithm; Tabu List

Indexed keywords

BENCH-MARK PROBLEMS; COMPLEX TASK; CROSSOVER AND MUTATION; EDUCATIONAL INSTITUTIONS; EXAMINATION TIMETABLING; HARD CONSTRAINTS; MEMETIC ALGORITHMS; MEMETIC APPROACH; NEIGHBOURHOOD; SOFT CONSTRAINT; TABU LIST;

EVOLUTIONARY ALGORITHMS; LAKES; MATHEMATICAL OPERATORS; ROUGH SET THEORY;

TABU SEARCH;

EID: 78349264587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16248-0_78     Document Type: Conference Paper

References (12)

1. Cheong, C.Y., Tan, K.C., Veeravalli, B.: Solving the exam timetabling problem via a multi-objective evolutionary algorithm: A more general approach. In: IEEE symposium on computational intelligence in scheduling, Honolulu, HI, USA, pp. 165-172 (2007)
2. Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S.: A time-predefined local search approach to exam timetabling problem. IIE Transactions 36(6), 509-528 (2004)
3. Caramia, M., Dell'Olmo, P., Italiano, G.F.: New algorithms for examination timetabling. In: Näher, S., Wagner, D. (eds.) WAE 2000. LNCS, vol. 1982, pp. 230-241. Springer, Heidelberg (2001)
4. Carter, M.W., Laporte, G., Lee, S.Y.: Examination Timetabling: Algorithmic Strategies and Applications. Journal of the Operational Research Society 47, 373-383 (1996)
5. Ct, P., Wong, T., Sabourin, R.: A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 294-312. Springer, Heidelberg (2005)
6. Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G.: A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling 12, 55-89 (2009)
7. Abdullah, S., Turabieh, H.: Generating university course timetable using genetic algorithm and local search. In: Proceeding of the 3rd International Conference on Hybrid Information Technology, pp. 254-260 (2008)
8. Abdullah, S., Burke, E.K., McCollum, B.: Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for University Course Timetabling. In: Metaheuristics: Progress in complex systems optimization (Operations Research/Computer Science Interfaces Series), ch. 8. Springer, Heidelberg (2007) ISBN:978-0-387-71919-1
9. Abdullah, S., Turabeih, H., McCollum, B.: A hybridization of electromagnetic like mechanism and great deluge for examination timetabling problems. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 60-72. Springer, Heidelberg (2009)
10. Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M.: Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling. OR Spectrum 29(2), 351-372 (2007)
11. Petrovic, S., Burke, E.K.: University timetabling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 45. CRC Press, Boca Raton (April 2004)
12. Yang, Y., Petrovic, S.: A novel similarity measure for heuristic selection in examination timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 247-269. Springer, Heidelberg (2005) 13. http://www.cs.qub.ac.uk/itc2007/