A graph-based hyper-heuristic for educational timetabling problems

European Journal of Operational Research

Volumn 176, Issue 1, 2007, Pages 177-192

  Burke, Edmund K ^a   McCollum, Barry ^b   Meisels, Amnon ^c   Petrovic, Sanja ^a   Qu, Rong ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Graph heuristics; Heuristics; Hyper heuristics; Tabu search; Timetabling

Indexed keywords

COLORING; GRAPH THEORY; PROBLEM SOLVING; SCHEDULING;

GRAPH COLORING; GRAPH HEURISTICS; TABU SEARCH; TIMETABLING;

HEURISTIC METHODS;

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

References (63)

1. Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M., 2004. Investigating Ahuja-Orlin's large neighbourhood search for examination timetabling. Technical Report NOTTCS-TR-2004-8, School of CSiT, University of Nottingham, UK.
2. Abramson D., Krishnamoorthy M., and Dang H. Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research 16 (1999) 1-22
3. Asmuni, H., Burke, E.K., Garibaldi, J., 2005. Fuzzy multiple ordering criteria for examination timetabling. In: Burke, E.K., Trick, M. (Eds.), Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, vol. 3616, pp. 344-354.
4. 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, pp. 16-29.
5. Bardadym V. Computer-aided school and university timetabling: The new wave. 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) 22-45
6. Beddoe, G., Petrovic, S., in press. Determining feature weights using a genetic algorithm in a case-based reasoning approach to personnel rostering. European Journal of Operational Research.
7. Brelaz D. New methods to color the vertices of a graph. Communications of the ACM 22 4 (1979) 251-256
8. In: Burke E.K., and Carter M. (Eds). Selected Papers from the 2nd International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 1408 (1998)
9. In: Burke E.K., and De Causmaecker P. (Eds). Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2740 (2003)
10. In: Burke E.K., and Erben W. (Eds). Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2079 (2001)
11. Burke E.K., and Newall J. A multi-stage evolutionary algorithm for the timetabling problem. The IEEE Transactions on Evolutionary Computation 3 1 (1999) 63-74
12. Burke E.K., and Newall J. Enhancing timetable solutions with local search methods. In: Burke E.K., and De Causmaecker P. (Eds). Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2740 (2003) 195-206
13. Burke E.K., and Petrovic S. Recent research directions in automated timetabling. European Journal of Operational Research 140 2 (2002) 266-280
14. 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)
15. Burke, E.K., Trick, M. (Eds.), 2005. Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling, Pittsburg PA, USA, August 2004. Lecture Notes in Computer Science, vol. 3616.
16. Burke E.K., Newall J., and Weare R. A memetic algorithm for university exam timetabling. 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) 241-250
17. 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
18. Burke E.K., Newall J., and Weare R. Initialization strategies and diversity in evolutionary timetabling. Evolutionary Computation 6 1 (1998) 81-103
19. Burke E.K., MacCarthy B., Petrovic S., and Qu R. Structured cases in case-based reasoning-Re-using and adapting cases for time-tabling problems. Knowledge-Based Systems 13 2-3 (2000) 159-165
20. Burke E.K., MacCarthy B., Petrovic S., and Qu R. Case-based reasoning in course timetabling: An attribute graph approach. In: David A., and Watson I. (Eds). Case-Based Reasoning Research and Development. Lecture Notes in Artificial Intelligence vol. 2080 (2001) 90-104
21. Burke E.K., Kendall G., Newall J., Hart E., Ross P., and Schulenburg S. Hyper-heuristics: An emerging direction in modern search technology. In: Glover F., and Kochenberger G. (Eds). Handbook of Meta-Heuristics (2003), Kluwer 457-474
22. Burke E.K., Kendall G., and Soubeiga E. A tabu search hyperheuristic for timetabling and rostering. Journal of Heuristics 9 6 (2003) 451-470
23. Burke E.K., MacCarthy B., Petrovic S., and Qu R. Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling. In: Burke E.K., and De Causmaecker P. (Eds). Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2740 (2003) 90-103
24. Burke E.K., Bykov Y., Newall J., and Petrovic S. A time-predefined local search approach to exam timetabling problems. IIE Transactions on Operations Engineering 36 6 (2004) 509-528
25. Burke E.K., De Causmaecker P., Vanden Berghe G., and Van Landeghem H. The state of the art of nurse rostering. Journal of Scheduling 7 6 (2004) 441-499
26. 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
27. 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
28. Burke E.K., Landa Silva J.D., and Soubeiga E. Multi-objective hyper-heuristic approaches for space allocation and timetabling. In: Ibaraki T., Nonobe K., and Yagiura M. (Eds). Meta-heuristics: Progress as Real Problem Solvers (2005), Springer 129-158
29. Burke, E.K., MacCarthy, B., Petrovic, S., Qu, R., in press. Multiple-retrieval case-based reasoning for course timetabling problems. Journal of Operations Research Society.
30. Burke E.K., Petrovic S., and Qu R. Case based heuristic selection for timetabling problems. Journal of Scheduling 2 9 (2006)
31. Caramia M., Dell'Olmo P., and Italiano G. New algorithms for examination timetabling. In: Naher S., and Wagner D. (Eds). Algorithm Engineering 4th International Workshop, WAE 2000. Lecture Notes in Computer Science vol. 1982 (2001) 230-241
32. Carter M. A lagrangian relaxation approach to the classroom assignment problem. INFOR 27 2 (1986) 230-246
33. Carter M., and Laporte G. Recent developments in practical exam timetabling. 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) 3-21
34. Carter M., and Laporte G. Recent developments in practical course timetabling. In: Burke E.K., and Ross P. (Eds). Selected Papers from the 2nd International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 1408 (1998) 3-19
35. Carter M., Laporte G., and Lee S. Examination timetabling: Algorithmic strategies and applications. Journal of Operations Research Society 47 (1996) 373-383
36. Casey S., and Thompson J. GRASPing the examination scheduling problem. In: Burke E.K., and De Causmaecker P. (Eds). Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2740 (2003) 232-246
37. Costa D. A tabu search for computing an operational timetable. European Journal of Operational Research 76 (1994) 98-110
38. Cheang B., Li H., Lim A., and Rodrigues B. Nurse rostering problems: A bibliographic survey. European Journal of Operational Research 151 3 (2003) 447-460
39. Côté P., Wong T., and Sabourin R. Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. In: Burke E.K., and Trick M. (Eds). Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 3616 (2005), Springer 294-312
40. de Werra D. Graphs, hypergraphs and timetabling. Methods of Operations Research. 49 (1985) 201-213
41. Deris B., Omatu S., Ohta H., and Samat D. University timetabling by constraint-based reasoning: A case study. Journal of Operational Research Society 48 12 (1997) 1178-1190
42. Di Gaspero L., and Schaerf A. Tabu search techniques for examination timetabling. In: Burke E.K., and Erben W. (Eds). Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2079 (2001) 104-117
43. Dowsland K. Off the peg or made to measure. In: Burke E.K., and Carter M. (Eds). Selected Papers from the 2nd International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 1408 (1998) 37-52
44. Dowsland, K., Soubeiga, E., Burke, E.K., in press. A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research, doi:10.1016/j.ejor.2005.03.058.
45. Easton K., Nemhauser G., and Trick M. Sports scheduling. In: Leung J. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press (Chapter 52)
46. Erben W. A grouping genetic algorithm for graph coloring and exam timetabling. In: Burke E.K., and Erben W. (Eds). Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2079 (2001) 132-158
47. Gaw, A., Rattadilok, P., Kwan, R.S., 2005. Distributed choice function hyperheuristics for timetabling and scheduling. In: Burke, E.K., Trick, M. (Eds.), Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, vol. 3616, pp. 51-70.
48. Glover F., and Kochenberger G. Handbook of Metaheuristics (2003), Kluwer
49. Han, L., Kendall, G., 2003. Investigation of a tabu assisted hyper-heuristic genetic algorithm. In: Congress on Evolutionary Computation, Canberra, Australia, pp. 2230-2237.
50. Kendall, G., Cowling, P., Soubeiga, E., 2002. Choice function and random hyperheuristics. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, pp. 667-671.
51. Kwan R. Bus and train driver scheduling. In: Leung J. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press (Chapter 51)
52. In: Leake D. (Ed). Case-based Reasoning: Experiences, Lessons and Future Directions (1996), AAAI Press, Menlo Park, CA
53. Lewis, R., Paechter, B., 2004. New crossover operators for timetabling with evolutionary algorithms. In: 5th International Conference on Recent Advances in Soft Computing, Nottingham, UK, vol. 5, pp. 189-195.
54. Merlot L., Boland N., Hughes B., and Stuckey P. A hybrid algorithm for the examination timetabling problem. In: Burke E.K., and De Causmaecker P. (Eds). Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2740 (2003) 207-231
55. Nonobe K., and Ibaraki T. A tabu search approach to the constraint satisfaction problem as a general problem solver. European Journal of Operational Research 106 (1998) 599-623
56. Petrovic S., and Burke E.K. University timetabling. In: Leung J. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press (Chapter 45)
57. Qu, R., Burke, E.K., 2005. Hybrid variable neighborhood hyper-heuristics for exam timetabling problems. In: Meta-heuristic International Conference 2005 (MIC2005), Vienna, August 2005.
58. Reeves C.R. Modern heuristic techniques. In: Rayward-Smith V.J., Osman I.H., Reeves C.R., and Smith G.D. (Eds). Modern Heuristic Search Methods (1996) 1-25
59. Ross P., Marin Blasques J.G., Schulenburg S., and Hart E. Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyper-heuristics. In: Cantú-Paz E., et al. (Ed). Genetic and Evolutionary Computation 2003. Lecture Notes in Computer Science vol. 2724 (2003) 1295-1306
60. Schaerf A. A survey of automated timetabling. Artificial Intelligence Review. 13 2 (1999) 87-127
61. Socha K., Knowles J., and Sampels M. A max-min ant system for the university course timetabling problem. Proceedings of the 3rd International Workshop on Ant Algorithms. Lecture Notes in Computer Science vol. 2463 (2002) 1-13
62. Terashima-Marin H., Ross P., and Valenzuela-Rendon M. Evolution of constraint satisfaction strategies in examination timetabling. Genetic Algorithms and Classifier Systems 1999 (2002) 635-642
63. Welsh D.J.A., and Powell M.B. The upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal 11 (1967) 41-47