A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem

European Journal of Operational Research

Volumn 197, Issue 2, 2009, Pages 482-491

  Pillay, N ^a   Banzhaf, W ^b  

^a UNIVERSITY OF KWAZULU NATAL   (South Africa)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Heuristics; Timetabling

Indexed keywords

BENCHMARKING;

EXAMINATION TIMETABLING; HEURISTICS; HYPER-HEURISTIC; TIMETABLING; UNCAPACITATED EXAMINATION TIMETABLING PROBLEMS;

HEURISTIC METHODS;

EID: 60649121122     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.07.023     Document Type: Article

References (31)

1. Abdullah S., Ahmadi S., Burke E.K., and Dror M. Investigating Ahuja-Orlin's large neighbourhood search for examination timetabling. OR Spectrum 29 2 (2007) 351-372
2. Asmuni H., Burke E.K., and Garibaldi J.M. Fuzzy multiple ordering criteria for examination timetabling. In: Burke E.K., and Trick M. (Eds). Selected Papers from the 5th International Conference on the Theory and Practice of Automated Timetabling (PATAT 2004) - The Theory and Practice of Automated Timetabling V. Lecture Notes in Computer Science vol. 3616 (2004), Springer, Berlin 147-160
3. Bilgin B., Ozcan E., and Korkmaz E.E. An experimental study on hyper-heuristics and exam timetabling. In: Burke E.K., and Rudova H. (Eds). Practice and Theory of Automated Timetabling VI: Selected Papers from the 6th International Conference, PATAT 2006. Lecture Notes in Computer Science vol. 3867 (2007), Springer, Berlin 394-412
4. Burke E.K., Elliman D.G., Ford P.H., and Weare R.F. Examination timetabling in British Universities - a survey. In: Burke E.K., and Ross P. (Eds). Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 1153 (1996), Springer 76-92
5. Burke E.K., and Petrovic S. Recent research directions in automated timetabling. European Journal of Operational Research 140 2 (2002) 266-280
6. Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S., 2003. Hyper-heuristics: An emerging direction in modern research technology. In: Handbook of Metaheuristics. Kluwer Academic Publishers, 2003, pp. 457-474 (Chapter 16).
7. Burke E.K., and Newall J.P. Solving examination timetabling problems through adaptation of heuristic orderings. Annals of Operations Research 129 (2004) 107-134
8. Burke E.K., Dror M., Petrovic S., and Qu R. Hybrid graph heuristics with a hyper-heuristic approach to exam timetabling problems. In: Golden B.L., Raghavan S., and Wasil E.A. (Eds). The Next Wave in Computing. Optimization, and Decision Technologies - Conference Volume of the 9th Informs Computing Society Conference (2005), Springer 79-91
9. Burke, E.K., Bykov, Y., 2006a. Solving exam timetabling problems with the Flex-Deluge algorithm 2006a. In: Burke, E.K., Rudova, H. (Eds.), Proceedings of the International Conference on the Theory and Practice of Automated Timetabling (PATAT 2006), pp. 370-372.
10. Burke, E.K., Eckersley, A., McCollum, B., Petrovic, S., Qu, R., 2006b. Hybrid variable neighbourhood approaches to university exam timetabling. Technical Report NOTTCS-TR-2006-2, School of Computer Science and Information Technology, University of Nottingham, UK.
11. Burke E.K., Petrovic S., and Qu R. Case-based heuristic selection for timetabling problems. Journal of Scheduling 9 2 (2006) 115-132
12. Burke E.K., McCollum B., Meisels A., Petrovic S., and Qu R. A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research 176 (2007) 177-192
13. Caramia M., Dell'Olmo P., and Italiano G. Novel local-search-based approaches to university examination timetabling. INFORMS Journal of Computing 20 1 (2008) 86-99
14. Carter M.W., Laporte G., and Lee S.Y. Examination timetabling: Algorithmic strategies and applications. The Journal of the Operational Research Society 47 3 (1996) 373-383
15. Casey S., and Thompson J. GRASPing the examination scheduling problem. In: Burke E.K., and De Causmaecker P. (Eds). The Practice and Theory of Automated Timetabling IV: Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling vol. 2740 (2003), Springer, Berlin 232-246
16. Di Gaspero L., and Schaerf A. Tabu search techniques for examination timetabling. Selected Papers from the 3rd International Conference on the Theory and Practice of Automated Timetabling. Lecture Notes in Computer Science vol. 2079 (2001), Springer, Berlin 104-117
17. Eley E. Ant algorithms for the exam timetabling problem. In: Burke E.K., and Rudova H. (Eds). Practice and Theory of Automated Timetabling VI: Selected Papers from the 6th International Conference, PATAT 2006. Lecture Notes in Computer Science vol. 3867 (2007), Springer, Berlin 364-382
18. Ersoy, E., Ozcan, E., Uyar, S., 2007. Memetic algorithms and hill-climbers. In: Baptiste, P., Kendall, G., Kordon, A.M., Sourd, F. (Eds.), Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications. Paris, France, pp. 159-166.
19. Kendall, G., Hussin, N.M., 2005. An investigation of a Tabu search based on hyper-heuristics for examination timetabling. In: Kendall, G., Burke, E.K., Petrovic, S. (Eds.), Selected Papers form Multidisciplinary Scheduling: Theory and Applications, pp. 309-328.
20. Koza J.R. Genetic Programming I: On the Programming of Computers by Natural Selection (1992), MIT Press
21. McCollum B. A perspective on bridging the gap between research and practice in university timetabling. In: Burke E.K., and Rudova H. (Eds). Practice and Theory of Automated Timetabling VI. Lecture Note in Computer Science vol. 3867 (2007), Springer 3-23
22. Merlot L.T.G., Boland N., Hughes B.D., and Stuckey P.J. A hybrid timetable for the examination timetabling problem. In: Burke E.K., and De Causmaecker P. (Eds). The Practice and Theory of Automated Timetabling IV: Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2740 (2003), Springer, Berlin 207-231
23. Meyers C., and Orlin J.B. Very large-scale neighborhood search techniques in timetabling problems. In: Burke E.K., and Rudova H. (Eds). Practice and Theory of Automated Timetabling VI: Selected Papers from the 6th International Conference, PATAT 2006. Lecture Notes in Computer Science vol. 3867 (2007), Springer, Berlin 24-39
24. Qu, R., Burke, E.K., 2005. Hybrid neighbourhood hyper-heuristics for exam timetabling problems 2005. In: Proceedings of the MIC2005: The Sixth Metaheuristics International Conference, Vienna, Austria, August 2005.
25. Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G., Lee, S.Y., 2008. A survey of search methodologies and automated approaches for examination timetabling. Journal of Scheduling, in press. doi:10.1007/s10951-008-0077-5.
26. Ranson D., and Ahmadh S. An extensible modelling framework for the examination timetabling problem. In: Burke E.K., and Rudova H. (Eds). Practice and Theory of Automated Timetabling VI: Selected Papers from the 6th International Conference, PATAT 2006. Lecture Notes in Computer Science vol. 3867 (2007), Springer, Berlin 383-393
27. Ross, P., Marin-Blazquez, J.G., Hart, E., 2004. Hyper-heuristics applied to class and exam timetabling. In: Proceedings of the 2004 Congress on Evolutionary Computation (CEC 2004), pp. 1691-1698.
28. Ross P. Hyper-heuristics. In: Burke E.K., and Kendall G. (Eds). Search Methodologies: Introductory Tutorials in Optimization and Decision Support Methodologies (2005), Kluwer Academic Publishers 529-556 Chapter 17
29. Schaerf, A., Di Gaspero, L., 2006. Measurability and reproducibility in timetabling research: State-of-the-art and discussion. In: Burke, E.K., Rudova, H. (Eds.), Proceedings of the International Conference on the Theory and Practice of Automated Timetabling (PATAT 2006), pp. 53-62.
30. Ulker O., Ozcan E., and Korkmaz E.E. Linear linkage in grouping problems: Applications on graph coloring and timetabling. In: Burke E.K., and Rudova H. (Eds). Practice and Theory of Automated Timetabling VI: Selected Papers from the 6th International Conference, PATAT 2006. Lecture Notes in Computer Science vol. 3867 (2007), Springer, Berlin 347-363
31. Yang Y., and Petrovic S. A Novel Similarity Measure for Heuristic Selection in Examination Timetabling. In: Burke E.K., and Trick M. (Eds). Selected Papers from the 5th International Conference on the Theory and Practice of Automated Timetabling (PATAT 2004) - The Theory and Practice of Automated Timetabling V. Lecture Notes in Computer Science vol. 3616 (2004), Springer, Berlin 247-269