Hybrid graph heuristics within a hyper-heuristic approach to exam timetabling problems

Operations Research/ Computer Science Interfaces Series

Volumn 29, Issue , 2005, Pages 79-91

  Burke, Edmund ^a   Dror, Moshe ^b   Petrovic, Sanja ^a   Qu, Rong ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF ARIZONA   (United States)

Author keywords

Case based reasoning; Exam timetabling problems; Graph heuristics; Hyper heuristics; Knowledge discovery; Tabu search

Indexed keywords

EID: 84888603386     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-387-23529-9_6     Document Type: Article

References (39)

1. V. Bardadym. Computer-Aided School and University Timetabling: The New Wave. In:, pp. 22-45. (1995).
2. E. Burke and P. Ross eds. Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling, LNCS 1153, Springer-Verlag, 1996).
3. E. Burke and M. Carter eds. Selected Papers from the 2nd International Conference on the Practice and Theory of Automated Timetabling, LNCS 1408. (Springer-Verlag, 1998).
4. E. Burke and W. Erben, W. eds. Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling, LNCS 2079, (Springer-Verlag, 2001).
5. E. Burke, K. Jackson, J Kingston and R. Weare. Automated Timetabling: The State of the Art. The Computer Journal, 40(9): 565-571, (1997).
6. E. Burke and P. Causmaecker, eds. Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling, LNCS 2740. (Springer-Verlag, 2003).
7. M. Carter and G. Laporte. Recent Developments in Practical Examination Timetabling. In:, pp. 3-21. (1995).
8. 3, pp. 3-19.
9. A. Schaerf. A Survey of Automated Timetabling. Artificial Intelligence Review. 13(2): 87-127. (1999).
10. E. Burke and S. Petrovic, Recent Research Directions in Automated Timetabling. EJOR, 140(2): 266-280. (2002).
11. D. Brelaz, New Methods to Color the Vertices of a Graph. Communications of the ACM, 22(4): 251-256. (1979).
12. de Werra, Graphs, Hypergraphs and Timetabling. Methods of Operations Research. 49: 201-213. (1985).
13. E. Burke, J. Kingston and D. de Werra, Applications to Timetabling, Handbook of Graph Theory, (J. Gross and J. Yellen eds.), pp. 445-474, (Chapman Hall/CRC Press, 2003).
14. M. Carter, A Lagrangian Relaxation Approach to the Classroom Assignment Problem. IFOR 27(2): 230-246. (1986).
15. B. Deris, S. Omatu, H. Ohta and D. Samat. University Timetabling by Constraint-based Reasoning: A Case Study. JORS. 48(12): 1178-1190. (1997).
16. K. Nonobe and T. Ibaraki A Tabu Search Approach to the Constraint Satisfaction Problem as a General Problem Solver. EJOR. 106: 599-623. (1998).
17. D. Banks, P. Beel and A. Meisles. A Heuristic Incremental Modelling Approach to Course Timetabling. Proceedings of the Canadian Conference on Artificial Intelligence, pp. 16-29. (1998).
18. F. Glover, and G. Kochenberger, Handbook of Metaheuristics, Kluwer. 2003.
19. D. Costa. A Tabu Search for Computing an Operational Timetable. EJOR. 76: 98-110.(1994).
20. L. Di Gaspero and A. Schaerf, Tabu Search Techniques for Examination Timetabling, In:, pp. 104-117. (2000).
21. 3, 37-52. (1998).
22. 6, pp. 205-230. (2002).
23. E. Burke, J. Newall and R. Weare, R. Initialization Strategies and Diversity in Evolutionary Timetabling. Evolutionary Computation, 6(1): 81-103. (1998).
24. E. Burke and J. Newall. A Multi-Stage Evolutionary Algorithm for the Timetabling Problem. The IEEE Transactions on Evolutionary Computation. 3(1): 63-74. (1999).
25. D. Leake ed. Case-based Reasoning: Experiences, Lessons and Future Directions. (AAAI Press, Menlo Park, CA. 1996).
26. E. Burke, B. Maccrthy, S. Petrovic, R. Qu, Structured Cases in Case-Based Reasoning - Re-using and Adapting Cases for Time-tabling Problems. Knowledge-Based Systems, 13(2-3): 159-165. (2000).
27. E. Burke, B. MacCarthy, S. Petrovic and R. Qu, Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems. Technical Report NOTTCS-TR-2004-3, School of CSiT, University of Nottingham, U.K. (accepted by JORS, 2004).
28. E. Burke, S. Petrovic and R. Qu, Case Based Heuristic Selection for Examination Timetabling. Technical Report NOTTCS-TR-2004-2, School of CSiT, University of Nottingham, U.K. (To appear in Journal of Scheduling, 2005).
29. 6, pp. 148-165. (2003).
30. E. Burke, E. Hart, G. Kendall, J. Newall, P. Ross and S. Schulenburg, Hyper-heuristics: an Emerging Direction in Modern Search Technology. In: F. Glover and G. Kochenberger eds., Handbook of Meta-Heuristics, (Kluwer, 2003), pp. 457-474.
31. G. Kendall, P. Cowling and E. Soubeiga, Choice Function and Random HyperHeuristics. Proceedings of SEAL'02, pp. 667-671. (2002).
32. E. Burke, G. Kendall, and E. Soubeiga, A Tabu Search Hyperheuristic for Timetabling and Rostering. Journal of Heuristics. 9(6). (2003).
33. L. Han and G. Kendall. Investigation of a Tabu Assisted Hyper-Heuristic Genetic Algorithm. Congress on Evolutionary Computation, Canberra, Australia, 2230-2237. (2003).
34. thInternational Conference on the Practice and Theory of Automated Timetabling. Pittsburgh, USA. Aug 2004.
35. E. Burke, Y. Bykov, J. Newall and S. Petrovic. A Time-Predefined Local Search Approach to Exam Timetabling Problems. HE Transactions on Operations Engineering, 36(6), 509-528, (2004).
36. 6, pp. 195-206. (2002).
37. M. Caramia, P. Dell'Olmo and G. Italiano, New Algorithms for Examination Timetabling. In: S. Naher and D. Wagner eds. LNCS 1982, pp. 230-241. (2001).
38. M. Carter, G. Laporte and S. Lee, Examination Timetabling: Algorithmic Strategies and Applications, JORS, 47: 373-383. (1996).
39. L. Merlot, N. Boland, B. Hughes and P. Stuckey. A Hybrid Algorithm for the Examination Timetabling Problem. In: E. Burke and P. De Causmaecker (eds.) Proceedings of the 4th International Conference on Practice and Theory of Timetabling, pp. 348-371. (2002).