Abstract
Although they are simple techniques from the early days of timetabling research, graph colouring heuristics are still attracting significant research interest in the timetabling research community. These heuristics involve simple ordering strategies to first select and colour those vertices that are most likely to cause trouble if deferred until later. Most of this work used a single heuristic to measure the difficulty of a vertex. Relatively less attention has been paid to select an appropriate colour for the selected vertex. Some recent work has demonstrated the superiority of combining a number of different heuristics for vertex and colour selection. In this paper, we explore this direction and introduce a new strategy of using linear combinations of heuristics for weighted graphs which model the timetabling problems under consideration. The weights of the heuristic combinations define specific roles that each simple heuristic contributes to the process of ordering vertices. We include specific explanations for the design of our strategy and present the experimental results on a set of benchmark real world examination timetabling problem instances. New best results for several instances have been obtained using this method when compared with other constructive methods applied to this benchmark dataset.
Similar content being viewed by others
References
Abdullah, S., Ahmadi, S., Burke, E. K., & Dror, M. (2007). Investigating Ahuja-Orlin’s large neighbourhood search for examination timetabling. OR Spectrum, 29(2), 351–372.
Abramson, D., Krishnamoorthy, M., & Dang, H. (1999). Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research, 16, 1–22.
Asmuni, H., Burke, E. K., Garibaldi, J., & McCollum, B. (2005). Fuzzy multiple ordering criteria for examination timetabling. In E. K. Burke & M. Trick (Eds.), Lecture notes in computer science: Vol. 3616. Selected papers from the 5th international conference on the practice and theory of automated timetabling (pp. 334–353).
Banks, D., Beek, P., & Meisles, A. (1998). A heuristic incremental modelling approach to course timetabling. In Proceedings of the 12th Canadian conference on artificial intelligence.
Bardadym, V. A. (1996). Computer-aided school and university timetabling: the new wave. In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science. Practice and theory of automated timetabling I: selected papers from the 1st international conference.
Brelaz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22, 251–256.
Broder, S. (1964). Final examination scheduling. Communications of the ACM, 7, 494–498.
Burke, E. K., & Newall, J. (1999). A multi-stage evolutionary algorithm for the timetabling problem. IEEE Transactions on Evolutionary Computation, 3, 63–74.
Burke, E. K., Petrovic, S., & Qu, R. (2006). Case based heuristic selection for timetabling problems. Journal of Scheduling, 9, 115–132.
Burke, E. K., Kendall, G., & Soubeiga, E. (2003). A tabu search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9, 451–470.
Burke, E. K., Kingston, J., & Dewerra, D. (2004). Applications to timetabling. In J. Gross & J. Yellen (Eds.), Handbook of graph theory. London/Boca Raton: Chapman Hall/CRC Press.
Burke, E. K., Eckersley, A. J., McCollum, B., Petrovic, S., & Qu, R. (2010). Hybrid variable neighbourhood approaches to university exam timetabling. European Journal of Operational Research (EJOR), 206, 46–53.
Caramia, M., Dellolmo, P., & Italiano, G. F. (2001). New algorithms for examination timetabling. In S. Naher & D. Wagner (Eds.), Lecture notes in computer science: Vol. 1982. Algorithm engineering 4th international workshop, proceedings WAE 2000 (pp. 230–241).
Carrington, J. R., Pham, N., Qu, R., & Yellen, J. (2007). An enhanced weighted graph model for examination/course timetabling. In Proceedings of 26th workshop of the UK planning and scheduling.
Carter, M. (1986). A Lagrangian relaxation approach to the classroom assignment problem. INFOR, 27, 230–246.
Carter, M., & Laporte, G. (1998). Recent developments in practical course timetabling. In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science. Selected papers from the 2nd international conference on the practice and theory of automated timetabling.
Carter, M., Laporte, G., & Lee, S. (1996). Examination timetabling: algorithmic strategies and applications. Journal of Operations Research Society, 47, 373–383.
Casey, S., & Thompson, J. (2002). GRASPing the examination scheduling problem. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science. Selected papers from the 4th international conference on the practice and theory of automated timetabling.
Cote, P., Wong, T., & Sabouri, R. (2005). Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. In E. K. Burke & M. Trick (Eds.), Lecture notes in computer science: Vol. 3616. Practice and theory of automated timetabling: selected papers from the 5th international conference (pp. 151–168).
de Werra, D. (1985). Graphs, hypergraphs and timetabling. Methods of Operations Research, 49, 201–213.
Di Gaspero, L., & Schaerf, A. (2000). Tabu search techniques for examination timetabling. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science. Selected papers from the 3rd international conference on the practice and theory of automated timetabling.
Dowsland, K. (1998). Off the peg or made to measure. In E. K. Burke & M. Carter (Eds.), Lecture notes in computer science. Selected papers from the 2nd international conference on the practice and theory of automated timetabling.
Glover, F., & Kochenberger, G. (2003). Handbook of metaheuristics. Dordrecht: Kluwer Academic.
Kiaer, L., & Yellen, J. (1992). Weighted graphs and university timetabling. Computers and Operations Research, 19, 59–67.
Krarup, J., & Dewerra, D. (1982). Chromatic optimization—limitations, objectives, uses, references. European Journal of Operational Research, 11, 1–19.
Mehta, N. K. (1981). The application of a graph-coloring method to an examination scheduling problem. Interfaces, 11, 57–65.
Merlot, L. T. G., Boland, N., Hughes, B. D., & Stuckey, P. J. (2003). A hybrid algorithm for the examination timetabling problem. In Practice and theory of automated timetabling IV (Vol. 2740, pp. 207–231).
Neufeld, G. A., & Tartar, J. (1974). Graph coloring conditions for existence of solutions to timetable problem. Communications of the ACM, 17, 450–453.
Nonobe, K., & Ibaraki, T. (1998). A tabu search approach to the constraint satisfaction problem as a general problem solver. European Journal of Operational Research, 106, 599–623.
Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. New York: Prentice-Hall.
Petrovic, S., & Burke, E. K. (2004). University timetabling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: CRC Press.
Qu, R., & Burke, E. K. (2005). Hybrid variable neighborhood hyper-heuristics for exam timetabling problems. In Proceedings of the 6th metaheuristics international conference.
Qu, R., Burke, E. K., McCollum, B., Merlot, L. T. G., & Lee, S. Y. (2009). A survey of search methodologies and automated approaches for examination timetabling. Journal of Scheduling, 12(1), 55–89.
Reeves, C. R. (1993). Modern heuristic techniques for combinatorial problems. Oxford: Scientific Publications.
Reeves, C. R. (1996). Modern heuristic techniques. In V. J. R-Smith, I. H. Osman, C. R. Reeves, & G. D. Smith (Eds.), Modern heuristic search methods.
Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13, 87–127.
Schmidt, G., & Strohlein, T. (1980). Timetable-construction—an annotated-bibliography. Computer Journal, 23, 307–316.
Socha, K., Knowles, J., & Sampels, M. (2002). A max-min ant system for the university course timetabling problem. In Lecture notes in computer science: Vol. 2463. Proceedings of the 3rd international workshop on ant algorithms.
Terashima-Marín, H., Ross, P., & Valenzuela-Rendón, M. (1999). Evolution of constraint satisfaction strategies in examination timetabling. In Genetic algorithms and classifier systems (pp. 635–642).
Welsh, D. J. A., & Powell, M. B. (1967). An upper bound for chromatic number of a graph and its application to timetabling problems. Computer Journal 10, 85–86.
Wood, D. C. (1968). A system for computing university examination timetables. The Computer Journal, 11, 41–47.
Yang, Y., & Petrovic, S. (2005). A Novel similarity measure for heuristic selection in examination timetabling. In E. K. Burke & M. Trick (Eds.), Lecture notes in computer science: Vol. 3616. Practice and theory of automated timetabling: selected papers from the 5th international conference (pp. 377–396).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Burke, E.K., Pham, N., Qu, R. et al. Linear combinations of heuristics for examination timetabling. Ann Oper Res 194, 89–109 (2012). https://doi.org/10.1007/s10479-011-0854-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0854-y