A hybrid metaheuristic approach to the university course timetabling problem

Journal of Heuristics

Volumn 18, Issue 1, 2012, Pages 1-23

  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

Course timetabling; Dynamic force decay rate; Electromagnetism like mechanism; Great deluge algorithm

Indexed keywords

DYNAMIC FORCES; LOCAL SEARCH; META-HEURISTIC APPROACH; METAHEURISTIC; OPTIMALITY; OVERALL QUALITY; SAMPLE POINT; SEARCH PROCESS; STOCHASTIC GLOBAL OPTIMIZATION; TEST PROBLEM; TIME SLOTS; TIMETABLING; TIMETABLING PROBLEM; UNIVERSITY COURSE; UNIVERSITY COURSE TIMETABLING-PROBLEMS; UPPER BOUNDARY;

ALGORITHMS; CURRICULA; DECAY (ORGANIC); ELECTROMAGNETISM; GLOBAL OPTIMIZATION; HEURISTIC METHODS; OPTIMIZATION;

DYNAMICS;

EID: 84856521155     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-010-9154-y     Document Type: Article

References (43)

1. Abdullah, S., Burke, E.K.: A multi-start large neighborhood search approach with local search methods for examination timetabling. In: The International Conference on Automated Planning and Scheduling (ICAPS 2006), pp. 334-337 (2006) (Pubitemid 44074225)
2. 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)
3. Abdullah, S., Burke, E.K., McCollum, B.: An investigation of variable neighborhood search for university course timetabling. In: The 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pp. 413-427 (2005)
4. Abdullah, S., Burke, E.K., McCollum, B.: Using a randomized iterative improvement algorithm with composite neighborhood structures for university course timetabling. In: Metaheuristics: Progress in Complex Systems Optimisation. Operations Research / Computer Science Interfaces Series. Springer, Berlin (2007a). Chap. 8. ISBN: 978-0-387-71919-1
5. Abdullah, S., Burke, E.K., McCollum, B.: A hybrid evolutionary approach to the university course timetabling problem. In: IEEE Congress on Evolutionary Computation, pp. 1764-1768 (2007b). ISBN: 1-4244-1340-0
6. Asmuni, H., Burke, E.K., Garibaldi, J.M.: Fuzzy multiple heuristic ordering for course timetabling. In: The Proceedings of the 5th United Kingdom Workshop on Computational Intelligence (UKCI05), London, UK, pp. 302-309 (2005)
7. Atsuta, M., Nonobe, K., Ibaraki, T.: ITC-2007 Track2: An Approach using General CSP Solver (2007). http://www.cs.qub.ac.uk/itc2007/winner/ bestcoursesolutions/Atsuta-et-al.pdf
8. Bardadym, VA: Computer-aided school and university timetabling: A new wave. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling V. LNCS, vol. 1153, pp. 22-45. Springer, Berlin (1996) (Pubitemid 126141958)
9. Birbil, S.I., Fang, S.C.: An electromagnetism-like mechanism for global optimization. J. Glob. Optim. 25, 263-282 (2003)
10. Burke, E.K., Newall, J.P.: Enhancing timetable solutions with local search methods. In: Burke, E.K., De Causmaecker, P. (eds.) Selected Papers from 4th International Conference on the Practice and Theory of Automated Timetabling. LNCS, vol. 2740, pp. 195-206. Springer, Berlin (2003)
11. Burke, E.K., Petrovic, S.: Recent research directions in automated timetabling. Eur. J. Oper. Res. 140(2), 266-280 (2002) (Pubitemid 34435033)
12. Burke, E.K., Elliman, D.G., Ford, P.H., Weare, R.F.: Examination timetabling in British universities - A survey. In: Burke, E.K., Ross, P. (eds.) Selected Papers from 1st International Conference on the Practice and Theory of Automated Timetabling. LNCS, vol. 1153, pp. 76-92 (1996) (Pubitemid 126141960)
13. Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyper-heuristic for timetabling and rostering. J. Heuristics 9(6), 451-470 (2003)
14. Burke, E.K., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for timetabling problems. Eur. J. Oper. Res. 176, 177-192 (2007)
15. Burke, E.K., Marecek, J., Parkes, A., Rudová, H.: Decomposition, reformulation, and diving in university course timetabling. Comput. Oper. Res. 37(3), 582-597 (2009)
16. Carter, M.W.: A survey of practical applications of examination timetabling algorithms. Oper. Res. 34(2), 193-202 (1986)
17. Carter, M.W., Laporte, G.: Recent developments in practical examination timetabling. In: Burke, E.K., Ross, P. (eds.) LNCS, vol. 1153, pp. 373-383 (1996)
18. Chiarandini, M., Birattari, M., Socha, K., Rossi-Doria, O.: An effective hybrid algorithm for university course timetabling. J. Sched. 9(5), 403-432 (2006)
19. Clark, M., Henz, M., Love, B.: QuikFix. A repair-based timetable solver. In: Proceedings of the Seventh PATAT Conference (2008). http://www.comp.nus.edu. sg/~henz/publications/ps/PATAT2008.pdf
20. De Cesco, F., Di Gaspero, L., Schaerf, A.: Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. In: Proceedings of the Seventh PATAT Conference (2008). http://tabu.diegm.uniud.it/ctt/DDS2008.pdf
21. de Werra, D.: An introduction to timetabling. Eur. J. Oper. Res. 19(2), 151-162 (1985)
22. Debels, D., Vanhoucke, M.: An electromagnetism meta-heuristic for the resource-constrained project scheduling problem. In: LNCS, vol. 3871, pp. 259-270. Springer, Berlin (2006) (Pubitemid 44011457)
23. Debels, D., De Reyck, B., Leus, R., Vanhoucke, M.: A hybrid scatter search/electromagnetism metaheuristic for project scheduling. Eur. J. Oper. Res. 169(2), 638-653 (2006) (Pubitemid 41375712)
24. Di Gaspero, L., Schaerf, A., McCollum, B.: The Second International Timetabling Competition (ICT-2007) Curriculum-based Course Timetabling (Track 3) (2007). http://pst.istc.cnr.it/ ssc-at-icaps-07/papers/digaspero-et-al-SSC07. pdf
25. Dueck, G.: New Optimization Heuristics. The great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104, 86-92 (1993)
26. Geiger, M.J.: An application of the threshold accepting metaheuristic for curriculum based course timetabling. In: Proceedings of the Seventh PATAT Conference (2008). arXiv:0809.0757v1
27. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimisation by simulated annealing. Science 220, 671-380 (1983)
28. Lach, G., Lübbecke, M.E.: Curriculum based course timetabling: Optimal solutions to the Udine benchmark instances. In: Proceedings of the Seventh PATAT Conference (2008). http://www.math. tu-berlin.de/luebbeck/papers/ udine.pdf
29. Landa-Silva, D., Obit, J.H.: Great deluge with non-linear decay rate for solving course timetabling problem. In: The Fourth International IEEE Conference on Intelligent Systems, Varna, Bulgaria, pp. 11- 18 (2008)
30. Lü, Z., Hao, J.-K.: Adaptive Tabu Search for course timetabling. Eur. J. Oper. Res. 200(1), 235-244 (2010)
31. Maenhout, B., Vanhoucke, M.: An electromagnetic meta-heuristic for the nurse scheduling problem. J. Heuristics 13, 315-401 (2007)
32. McCollum, B.: A perspective on bridging the gap between theory and practice in university timetabling. In: LNCS, vol. 3867, pp. 3-23. Springer, Berlin (2007)
33. McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A., Di Gaspero, L., Qu, R., Burke, E.K.: Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS J. Comput. 22(1), 120-130 (2010)
34. McMullan, P.: An extended implementation of the great deluge algorithm for course timetabling. In: Computational Science - ICCS, Part I. LNCS, vol. 4487, pp. 538-545. Springer, Berlin (2007) (Pubitemid 350269688)
35. McMullan, P., McCollum, B.: Dynamic job scheduling on the grid environment using the great deluge algorithm. In: The 9th International Conference on Parallel Computing Technologies. LNCS, vol. 4671, pp. 283-292. Springer, Berlin (2007)
36. Müller, T., ITC2007: Solver description. In: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (2007). http://www.unitime.org/papers/itc2007.pdf
37. Müller, T., ITC2007 solver description: a hybrid approach. Ann. Oper. Res. 172(1), 429-446 (2009)
38. Petrovic, S., Burke, E.K.: University timetabling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004). Chap. 45
39. Petrovic, S., Yang, Y., Dror, M.: Case-based selection of initialisation heuristics for metaheuristic examination timetabling. Expert Syst. Appl. 33(3), 772-785 (2007) (Pubitemid 46366681)
40. Rossi-Doria, O., Samples, M., Birattari,M., Chiarandini,M., Dorigo, M., Gambardella, L.M., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., Stützle, T.: A comparison of the performance of different meta-heuristics on the timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) The Practice and Theory of Automated Timetabling IV: Selected Papers from 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT IV), Gent, Belgium. LNCS, vol. 2740, pp. 329-354. Springer, Berlin (2003) (Pubitemid 37095598)
41. Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13(2), 87-127 (1999)
42. Socha, K., Knowles, J., Samples,M.: A max-min ant system for the university course timetabling problem. In: The Proceedings of the 3rd International Workshop on Ant Algorithms (ANTS 2002). LNCS, vol. 2463, pp. 1-13. Springer, Berlin (2002)
43. Turabieh, H., Abdullah, S., McCollum, B.: Electromagnetism-like mechanism with force decay rate great deluge for the course timetabling problem. In: The Fourth International Conference on Rough Set and Knowledge Technology (RSKT 2009). LNAI, vol. 5589, pp. 497-504. Springer, Berlin (2009)