A novel similarity measure for heuristic selection in examination timetabling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3616 LNCS, Issue , 2005, Pages 247-269

  Yang, Yong ^a   Petrovic, Sanja ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; FUZZY SETS; GRAPH THEORY;

CASE BASED REASONING (CBR); METAHEURISTIC; REAL-WORLD BENCHMARK PROBLEMS;

PROBLEM SOLVING;

EID: 33645976434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593577_15     Document Type: Conference Paper

References (49)

1. Burke, E. K., Bykov, Y., Newall, J. P., Petrovic, S.: A Time-Predefined Local Search Approach to Exam Timetabling Problems. IIE Trans. Oper. Eng. 36 (2004) 509-528
2. Burke, E. K., Eckersley, A. J., McCollum, B., Petrovic, S., Qu, R.: Similarity Measures For Exam Timetabling Problems. In: Proc. 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (2003) 120-136
3. Burke, E. K., Dror, M., Petrovic, S., Qu, R.: Hybrid Graph Heuristics in a Hyper-Heuristic Approach to Exam Timetabling. In: Golden, B.L., Raghavan, S., Wasil, E. A. (eds.): The Next Wave in Computing, Optimization and Decision Technologies. Springer, Berlin (2005) 79-92
4. Burke, E. K., Elliman, D. G., Ford, P. H., Weare, R. F.: Examination Timetabling in British Universities - A Survey. In: Burke, E., Ross, P.: The Practice and Theory of Automated Timetabling I (PATAT'95, Selected Papers). Lecture Notes in Computer Science, Vol. 1153, Springer, Berlin (1996) 76-92
5. Burke, E. K., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-Heuristics: An Emerging Direction in Modern Search Technology. Chapter 16 in: Glover, F., Kochenberger, G. (eds.): Handbook of Metaheuristics, Kluwer, Dordrecht (2003) 457-474
6. Burke, E. K., Kendall, G., Soubeiga, E.: A Tabu Search Hyper-heuristic for Timetabling and Rostering. J. Heuristics 9 (2003) 451-470
7. Burke, E., Kingston, J., De Werra, D.: Applications to Timetabling. Section 5.6 in: Gross, J., Yellen, J. (eds.): Handbook of Graph Theory, Chapman and Hall/CRC Press, London (2004) 445-474
8. Burke, E. K., Landa, J. D.: Design of Memetic Algorithms for Scheduling and Timetabling Problems. In: Krasnogor, N., Hart, W., Smith, J. (eds.): Recent Advances in Memetic Algorithms and Related Search Technologies. Springer, Berlin (2004) 289-312
9. Burke, E. K., MacCarthy, B., Petrovic, S., Qu, R.: Structured Cases in CBR - Reusing and Adapting Cases for Time-Tabling Problems. Knowledge-Based Syst. 13 (2000) 159-165
10. Burke, E., MacCarthy, B., Petrovic, S., Qu, R.: Knowledge Discovery in a Hyper-heuristic Using Case-Based Reasoning for Course Timetabling. In: Burke, E., De Causmaecker, P.: Practice and Theory of Automated Timetabling IV (PATAT'02, Selected Papers). Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin (2003) 276-287
11. Burke, E. K., MacCarthy, B., Petrovic, S., Qu, R.: Multiple-Retrieval Case Based Reasoning for Course Timetabling Problems. J. Oper. Res. Soc. (2005) accepted for publication
12. Burke, E. K., Meisels, A., Petrovic, S., Qu, R.: A Graph-Based Hyper Heuristic for Timetabling Problems. Eur. J. Oper. Res. (2005) accepted for publication
13. Burke, E. K., Newall, J. P., Weare, R. F.: A Memetic Algorithm for University Exam Timetabling. In: Burke, E., Ross, P.: The Practice and Theory of Automated Timetabling I (PATAT'95, Selected Papers). Lecture Notes in Computer Science, Vol. 1153, Springer, Berlin (1996) 241-250
14. Burke, E. K., Newall, J. P.: Enhancing Timetable Solutions with Local Search Methods. In: Burke, E., De Causmaecker, P.: Practice and Theory of Automated Timetabling IV (PATAT'02, Selected Papers). Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin (2003) 195-206
15. Burke, E. K., Newall, J. P., Weare, R. F.: Initialisation Strategies and Diversity in Evolutionary Timetabling. Evol. Comput. 6 (1998) 81-103
16. Burke, E. K., Newell, J. P.: Solving Examination Timetabling Problems Through Adaptation of Heuristic Orderings. Ann. Oper. Res. 129 (2004) 107-134
17. Burke, E. K., Newell, J. P., Weare, R. F.: A Simple Heuristically Guided Search for the Timetable Problem. In: Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems (University of La Laguna). Academic, New York (1998) 574-579
18. Burke, E. K., Petrovic, S.: Recent Research Directions in Automated Timetabling. Eur. J. Oper. Res. 140 (2002) 266-280
19. Burke, E. K., Petrovic, S., Qu, R.: Case Based Heuristic Selection for Timetabling Problems. J. Scheduling (2006) accepted for publication
20. Carter, M. W.: A Survey of Practical Applications on Examination Timetabling. Oper. Res. 34 (1986) 193-202
21. Carter, M. W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E., Ross, P.: The Practice and Theory of Automated Timetabling I (PATAT'95, Selected Papers). Lecture Notes in Computer Science, Vol. 1153, Springer, Berlin (1996) 3-21
22. Carter, M. W., Laporte, G., Chinneck, J. W.: A General Examination Scheduling System. Interfaces 24 (1994) 109-120
23. Carter, M. W., Laporte, G., Lee, S. Y.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47 (1996) 373-383
24. Carter, M. W., Johnson, D. G.: Extended Clique Initialisation in Examination Timetabling. J. Oper. Res. Soc. 52 (2001) 538-544
25. Casey, S., Thompson, J.: GRASPing the Examination Scheduling Problem. In: Burke, E., De Causmaecker, P.: Practice and Theory of Automated Timetabling IV (PATAT'02, Selected Papers). Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin (2003) 232-246
26. Deng, P. S.: Using Case-Based Reasoning Approach to the Support of Ill-structured Decisions. Eur. J. Oper. Res. 93 (1996) 511-521
27. Di Gaspero, L., Schaerf, A.: Tabu Search Techniques for Examination Timetabling. In: Burke, E., Erben, W.: The Practice and Theory of Automated Timetabling III (PATAT'00, Selected Papers). Lecture Notes in Computer Science, Vol. 2079. Springer, Berlin (2001) 104-117
28. Dueck, G.: New Optimization Heuristics. J. Comput. Phys. 104 (1993) 86-92
29. Garey, M. R., Johnson, D. S.: Computers and Intractability a Guide to the Theory of NP-completeness. Freeman, San Francisco (1977)
30. Gendreau, M., Soriano, P., Salvail, L.: Solving the Maximum Clique Problem Using a Tabu Search Approach. Ann. Oper. Res. 41 (1993) 385-403
31. Johnson, D.: Timetabling University Examinations. J. Oper. Res. Soc. 41 (1990) 39-47
32. Kolodner, J.: Case-Based Reasoning. Morgan Kaufmann, San Mateo, CA (1993)
33. Laporte, G., Desroches S.: Examination Timetabling by Computer. Comput. Oper. Res. 11 (1984) 351-360
34. Leake, D. B.: CBR in Context: the Present and Future, Case-Based Reasoning: Experiences, Lessons, and Future Directions. AAAI Press/MIT Press, Menlo Park, CA (1996)
35. Merlot, L. T. G., Boland, N., Hughes, B. D., Stuckey, P. J.: A Hybrid Algorithm for the Examination Timetabling Problem. In: Burke, E., De Causmaecker, P.: Practice and Theory of Automated Timetabling IV (PATAT'02, Selected Papers). Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin (2003) 205-232
36. Miyashita, K., Sycara, K.: CABINS: A Framework of Knowledge Acquisition and Iterative Revision for Schedule Improvement and Reactive Repair. Artif. Intell. 76 (1995) 377-426
37. Petrovic, S., Beddoe, G. R., Berghe, G. V.: Storing and Adapting Repair Experiences in Employee Rostering. In: Burke, E., De Causmaecker, P.: Practice and Theory of Automated Timetabling IV (PATAT'02, Selected Papers). Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin (2003) 149-166
38. Petrovic, S., Burke, E.: Educational Timetabling. Chapter 45 in: Leung, J. (ed.): Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman and Hall/CRC Press, London (2004), 45.1-45.23
39. Petrovic, S., Kendall, G., Yang, Y.: A Tabu Search Approach for Graph-Structured Case Retrieval. In: Proc. STarting Artificial Intelligence Researchers Symposium (France). IOS Press (2002) 55-64
40. Petrovic, S., Yang Y., Dror, M.: Case-based Initialisation of Metaheuristics for Examination Timetabling. In: Kendall, G., Burke, E., Petrovic, S., Gendreau, M. (eds.): Multidisciplinary Scheduling Theory and Applications. Springer, Berlin (2005) 289-308
41. Petrovic, S, Yang, Y., Dror, M.: Use of Case Based Reasoning In Solving Examination Timetabling Problems. Technical Report NOTTCS-TR-2004-6, University of Nottingham, UK (2004)
42. Schirmer, A.: Case-Based Reasoning and Improved Adaptive Search for Project Scheduling. Naval Res. Log. 47 (2000) 201-222
43. Schmidt, G.: Case-Based Reasoning for Production Scheduling. Int. J. Product. Econ. 56/7 (1998) 537-546
44. Terashima-Marín, H., Ross, P., Valenzuela-Rendón, M.: Evolution of Constraint Satisfaction Strategies in Examination Timetabling. In: Proceedings of the Genetic and Evolutionary Conference (1999) 635-642
45. Thompson, J. M., Dowsland, K. A.: Variants of Simulated Annealing for the Examination Timetabling Problem. Ann. Oper. Res. 63 (1996) 105-128
46. Welsh, D. J. A., Powell, M. B.: An Upper Bound on the Chromatic Number of a Graph and its Application to Timetabling Problems. Comput. J. 10 (1967) 85-86
47. White, G. M., Xie, B. S., Zonjic, X.: Using Tabu Search With Longer-Term Memory and Relaxation to Create Examination Timetables. Eur. J. Oper. Res. 153 (2004) 80-91
48. Zadeh, L. A.: Fuzzy Sets. Inform. Control 8 (1965) 338-353
49. Zadeh, L. A.: The Concept of a Linguistic Variable and its Application to Approximate Reasoning. Inform. Sci. 8, 9 (1975) 199-249, 43-80, respectively