Abstract
Graph colouring heuristics have long been applied successfully to the exam timetabling problem. Despite the success of a few heuristic ordering criteria developed in the literature, the approaches lack the ability to handle the situations where ties occur. In this paper, we investigate the effectiveness of applying tie breakers to orderings used in graph colouring heuristics. We propose an approach to construct solutions for our problem after defining which heuristics to combine and the amount of each heuristic to be used in the orderings. Heuristic sequences are then adapted to help guide the search to find better quality solutions. We have tested the approach on the Toronto benchmark problems and are able to obtain results which are within the range of the best reported in the literature. In addition, to test the generality of our approach we introduced an exam timetabling instance generator and a new benchmark data set which has a similar format to the Toronto benchmark. The instances generated vary in size and conflict density. The publication of this problem data to the research community is aimed to provide researchers with a data set which covers a full range of conflict densities. Furthermore, it is possible using the instance generator to create random data sets with different characteristics to test the performance of approaches which rely on problem characteristics. We present the first results for the benchmark and the results obtained show that the approach is adaptive to all the problem instances that we address. We also encourage the use of the data set and generator to produce tailored instances and to investigate various methods on them.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asmuni, H., Burke, E.K., Garibaldi, J.M., McCollum, B.: Fuzzy multiple heuristic orderings for examination timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 334–353. Springer, Heidelberg (2005)
Brelaz, D.: New methods to colour the vertices of a graph. Communications of the ACM 22, 251–256 (1979)
Burke, E., Newall, J.: Solving examination timetabling problems through adaptation of heuristic orderings. Annals of Operations Research 129, 107–134 (2004)
Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: An emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-Heuristics, pp. 457–474. Kluwer, Dordrecht (2003)
Burke, E., de Werra, D., Kingston, J.: Applications to timetabling. In: Gross, J., Yellen, J. (eds.) Handbook of Graph Theory, ch. 5.6, pp. 445–474. Chapman Hall/CRC Press (2004)
Burke, E., Petrovic, S., Qu, R.: Case based heuristic selection for timetabling problems. Journal of Scheduling 9(2), 115–132 (2006)
Burke, E., 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)
Carter, M., Laporte, G.: Recent developments in practical exam timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 3–21. Springer, Heidelberg (1996)
Carter, M., Laporte, G., Lee, S.: Examination timetabling: Algorithmic strategies and applications. Journal of Operational Research Society 74, 373–383 (1996)
Cote, P., Wong, T., Sabouri, R.: Application of a hybrid multi-objective evolutionary algorithm to the uncapicitated exam proximity problem. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 151–168. Springer, Heidelberg (2005)
Di Gaspero, L., Schaerf, A.: Tabu search techniques for examination timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 104–117. Springer, Heidelberg (2001)
Duong, T., Lam, K.: Combining constraint programming and simulated annealing on university exam timetabling. In: Proceedings of the 2nd International Conference in Computer Sciences, Research, Innovation & Vision for the Future (RIVF 2004), pp. 205–210 (2004)
Kendall, G., Hussin, N.: An investigation of a tabu search based hyper-heuristic for examination timetabling. In: Kendall, G., Burke, E., Petrovic, S., Gendreau, M. (eds.) Selected Papers from MISTA 2003, pp. 309–328. Springer, Heidelberg (2005)
McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, L., Di Gaspero, A. J.: Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing 22(1) (2010)
Mumford, C.: An order based evolutionary approach to dual objective examination timetabling. In: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 (2007)
Qu, R., Burke, E., McCollum, B.: Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems. European Journal of Operational Research 198, 392–404 (2009)
Qu, R., Burke, E., McCollum, B., Merlot, L., Lee, S.: A survey of search methodologies and automated approaches for examination timetabling. Journal of Scheduling 12, 55–89 (2009b)
Ross, P.: Hyper-heuristics. In: Burke, E., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimisation, Decision Support Techniques, ch. 17, pp. 529–556. Springer, Heidelberg (2005)
Thompson, J., Dowsland, K.: A robust simulated annealing based examination timetabling system. Computer & Operations Research 25, 637–648 (1998)
White, G.M., Xie, B.S.: Examination timetables and tabu search with longer-term memory. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 85–103. Springer, Heidelberg (2001)
Wong, T., Cote, P., Gely, P.: Final exam timetabling: a practical approach. In: IEEE Canadian Conference on Electrical and Computer Engineering(CCECE 2002), vol. 2, pp. 726–731 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Burke, E.K., Qu, R., Soghier, A. (2011). An Adaptive Tie Breaking and Hybridisation Hyper-Heuristic for Exam Timetabling Problems. In: Pelta, D.A., Krasnogor, N., Dumitrescu, D., Chira, C., Lung, R. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2011). Studies in Computational Intelligence, vol 387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24094-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-24094-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24093-5
Online ISBN: 978-3-642-24094-2
eBook Packages: EngineeringEngineering (R0)