Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems

European Journal of Operational Research

Volumn 198, Issue 2, 2009, Pages 392-404

  Qu, Rong ^a   Burke, Edmund K ^a   McCollum, Barry ^b  

^a Nottingham University Jubilee Campus   (United Kingdom)

^b QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

Adaptive; Exam timetabling; Graph colouring; Graph colouring heuristics; Hybridisation; Hyper heuristic

Indexed keywords

BENCHMARKING;

ADAPTIVE; EXAM TIMETABLING; GRAPH COLOURING; GRAPH COLOURING HEURISTICS; HYBRIDISATION; HYPER-HEURISTIC;

HEURISTIC METHODS;

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

References (45)

1. Abdullah S., Ahmadi S., Burke E., and Dror M. Investigating Ahuja-Orlin's large neighbourhood search for examination timetabling. OR Spectrum 29 2 (2007) 351-372
2. V.A. Bardadym, Computer-aided school and university timetabling: The new wave, in: E.K. Burke, P. Ross, (Eds.), Practice and Theory of Automated Timetabling I: Selected Papers from the 1st International Conference, Lecture Notes in Computer Science, vol. 1153, 1996, pp. 22-45.
3. B. Bilgin, E. Ozcan, E.E. Korkmaz, An experimental study on hyper-heuristics and exam scheduling, in: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, 2006, pp. 123-140.
4. Brelaz D. New methods to color the vertices of a graph. Communications of the ACM 22 4 (1979) 251-256
5. Burke E., Bykov Y., Newall J., and Petrovic S. A time-predefined local search approach to exam timetabling problems. IIE Transactions 36 6 (2004) 509-528
6. Burke E.K., Dror M., Petrovic S., and Qu R. Hybrid graph heuristics within 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 (2005), Springer 79-91
7. E.K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, S. Schulenburg, Hyperheuristics: An emerging direction in modern search technology, in: F. Glover, G. Kochenberger, (Eds.), Handbook of Metaheuristics, pp. 457-474, 2003.
8. Burke E.K., Jackson S., Kingston H., and Weare F. Automated timetabling: The state of the art. The Computer Journal 40 9 (1997) 565-571
9. In: Burke E.K., and Kendall G. (Eds). Search Methodologies: Introductory Tutorials in Optimisation and Decision Support Techniques (2005), Springer 239-272
10. Burke E.K., Kendall G., and Soubeiga E. A Tabu Search hyperheuristic for timetabling and rostering. Journal of Heuristics 9 6 (2003) 451-470
11. Burke E.K., Kingston J., and de Werra D. Applications to timetabling. In: Gross J., and Yellen J. (Eds). Handbook of Graph Theory (2004), Chapman Hall/CRC Press 445-474
12. Burke E.K., MacCarthy B., Petrovic S., and Qu R. Multiple-retrieval case-based reasoning for course timetabling problems. Journal of Operational Research Society 57 2 (2006) 148-162
13. Burke E.K., McColum B., Meisels A., Petrovic S., and Qu R. A graph-based hyper heuristic for timetabling problems. European Journal of Operational Research 176 (2007) 177-192
14. Burke E.K., and Newall J.P. A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation 3 1 (1999) 63-74
15. E.K. Burke, J. Newall, Enhancing timetable solutions with local search methods, in: E.K. Burke, P. Causmaecker (Eds.), Practice and Theory of Automated Timetabling: Selected Papers from the 4th International Conference, Lecture Notes in Computer Science, vol. 2740, 2003, pp. 195-206.
16. Burke E.K., and Newall J.P. Solving examination timetabling problems through adaptation of heuristic orderings. Annals of Operations Research 129 (2004) 107-134
17. Burke E.K., and Petrovic S. Recent research directions in automated timetabling. European Journal of Operational Research 140 2 (2002) 266-280
18. Burke E.K., Petrovic S., and Qu R. Case based heuristic selection for examination timetabling. Journal of Scheduling 9 2 (2006) 115-132
19. Caramia M., Dell'Olmo P., and Italiano G.F. Novel local-search-based approaches to university examination timetabling. INFORMS Journal of Computing 20 1 (2008) 86-99
20. M. Carter, G. Laporte, Recent developments in practical exam timetabling, in: E.K. Burke, P. Ross (Eds.), Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference (PATAT95), Lecture Notes in Computer Science, vol. 1153, 1996, pp. 3-21.
21. Carter M., Laporte G., and Lee S. Examination timetabling: Algorithmic strategies and applications. Journal of Operational Research Society 47 (1996) 373-383
22. S. Casey, J. Thompson, GRASPing the examination scheduling problem, in: E.K. Burke, P. Causmaecker, (Eds.), Practice and Theory of Automated Timetabling: Selected Papers from the 4th International Conference (PATAT02), Lecture Notes in Computer Science, vol. 2740, 2002, pp. 232-246.
23. P. David, A constraint-based approach for examination timetabling using local repair techniques, in: E.K. Burke, M.W. Carter, (Eds.), Practice and Theory of Automated Timetabling II: Selected Papers from the 2nd International Conference, Lecture Notes in Computer Science, vol. 1408, 1998, pp. 169-186.
24. de Werra D. An introduction to timetabling. European Journal of Operational Research 19 (1985) 151-162
25. L. Di Gaspero, A. Schaerf, Tabu Search techniques for examination timetabling, in: E.K. Burke, W. Erben, (Eds.), Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference (PATAT00), Lecture Notes in Computer Science, vol. 2079, 2000, pp. 104-117.
26. Dowsland K.A., and Thompson J. Ant colony optimization for the examination scheduling problem. Journal of Operational Research Society 56 (2005) 426-438
27. Glover F., and Kochenberger G. Handbook of Metaheuristics (2003) 457-474
28. Glover F., and Laguna M. Tabu Search (1997), Kluwer, Boston
29. Joslin D.E., and Clements D.P. "Squeaky wheel" optimization. Journal of AI Research 10 (1999) 353-373
30. Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) 85-103
31. Le Huédé F., Grabisch M., Labreuche C., and Savéant P. MCSA new algorithm for multicriteria optimisation in constraint programming. Annals of Operational Research 147 (2006) 143-174
32. Lewis R. A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30 1 (2008) 167-190
33. B.G.C. McCollum, A perspective on bridging the gap between theory and practice in university timetabling, in: E.K. Burke, H. Rudova, (Eds.), Practice and Theory of Automated Timetabling VI: Selected Papers from the 6th International Conference. Lecture Notes in Computer Science, vol. 3867, 2007, pp. 3-23.
34. L. Merlot, N. Boland, B. Hughes, P. Stuckey, A hybrid algorithm for the examination timetabling problem, in: E.K. Burke, P. Causmaecker (Eds.), Practice and Theory of Automated Timetabling: Selected Papers from the 4th International Conference (PATAT02), Lecture Notes in Computer Science, vol. 2740, 2003, pp. 207-231.
35. C. Meyers, J.B. Orlin, Very large-scale neighbourhood search techniques, in: E.K. Burke, H. Rudova, (Eds.), Practice and Theory of Automated Timetabling VI: Selected Papers from the 6th International Conference. Lecture Notes in Computer Science, vol. 3867, 2007, pp. 24-39.
36. E. Ozcan, N. Bilgin, E.E. Korkmaz, Hill climbers and mutational heuristics in hyperheuristics, in: Proceedings of the 9th International Conference on Parallel Problem Solving from Nature, 2006, pp. 202-211.
37. Petrovic S., and Burke E.K. University timetabling. In: Leung J. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapter 45 (2004), CRC Press April
38. R. Qu, E.K. Burke, Adaptive decomposition and construction for examination timetabling problems, Multidisciplinary International Scheduling: Theory and Applications Conference, August 2007, Paris, France, pp. 418-425.
39. R. Qu, E.K. Burke, Hybridisations within a graph based hyper-heuristic framework for university timetabling problems. Journal of Operational Research Society, in press.
40. R. Qu, E.K. Burke, B. McCollum, L.T.G. Merlot, S.Y. Lee, A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, in press, doi:10.1007/s10951-008-0077-5.
41. P. Rattadilok, R.S. Kwan, Dynamically configured λ-opt heuristics for bus scheduling, in: E.K. Burke, H. Rudova (Eds.), Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, 2006, pp. 473-477.
42. Salavatipour M.R. On sum coloring of graphs. Discrete Applied Mathematics 127 3 (2003) 477-488
43. Schaerf A. A survey of automated timetabling. Artificial Intelligence Review 13 2 (1999) 87-127
44. Thompson J., and Dowsland K. A robust simulated annealing based examination timetabling system. Computers & Operations Research 25 (1998) 637-648
45. A. Wren, Scheduling, timetabling and rostering - A special relationship? in: E.K. Burke, P. Ross, (Eds.), Practice and Theory of Automated Timetabling I: Selected Papers from the 1st International Conference, Lecture Notes in Computer Science, vol. 1153, 1996, pp. 46-75.