Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Burke, Edmund; Eckersley, Adam; McCollum, Barry; Petrovic, Sanja; Qu, Rong (2003)
Languages: English
Types: Unknown
A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance or a small subset of instances related to a given real-life problem. Our aim is to develop a more general system which, when given any exam timetabling problem, will produce results which are comparative to those of a specially designed heuristic for that problem. We are investigating a Case based reasoning (CBR) technique to select from a set of algorithms which have been applied successfully to similar problem instances in the past. The assumption in CBR is that similar problems have similar solutions. For our system, the assumption is that an algorithm used to find a good solution to one problem will also produce a good result for a similar problem. The key to the success of the system will be our definition of similarity between two exam timetabling problems. The study will be carried out by running a series of tests using a simple Simulated Annealing Algorithm on a range of problems with differing levels of similarity and examining the data sets in detail. In this paper an initial investigation of the key factors which will be involved in this measure is presented with a discussion of how the definition of good impacts on this.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] Burke, E.K., Elliman, D.G., Ford, P., Weare, R.F. Examination Timetabling in British Universities - A Survey, in [7], pp 76-92.
    • [2] Burke, E.K., MacCarthy, B., Petrovic, S., Qu, R. Structured cases in case-based reasoning - re-using and adapting cases for time-tabling problems. Knowledge-Based Systems 13 (2000) pp 159-165.
    • [3] Burke, E.K., MacCarthy, B., Petrovic, S., Qu, R. Case-Based Reasoning in Course Timetabling: An Attribute Graph Approach. Proceedings of the 4th. International Conference on Case-Based Reasoning, ICCBR-2001, Vancouver, Canada, 30 July - 2 August 2001. Springer, Lecture Notes in Artificial Intelligence vol. 2080, pp. 90-104
    • [4] Burke, E.K. and Erben, W. (eds). PATAT 2000 - Proceedings of the 3rd international conference on the Practice and Theory of Automated Timetabling.
    • [5] Burke, E.K. and Erben, W. (eds). The Practice and Theory of Automated Timetabling III, volume 2079 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
    • [6] Burke, E.K. and Petrovic, S. Recent Research Directions in Automated Timetabling. European Journal of Operational Research - EJOR, 140/2, 2002, 266-280
    • [7] Burke, E.K. and Ross, P., editors. Practice and Theory of Automated Timetabling, volume 1153 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
    • [8] Carter, M. W. and Laporte, G. Recent Developments in Practical Examination Timetabling In [7], pp 3-21.
    • [9] Carter, M. W., Laporte, G. and Lee, S. Y. Examination timetabling: Algorithmic strategies and applications. Journal of Operational Research Society, 74:373-383, 1996.
    • [10] Erben, W. A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling. In [5], pp 132-158
    • [11] Henderson, D., Jacobson, S. H. and Johnson, A. W. The Theory and Practice of Simulated Annealing. In Glover, F. and Kochenberger, G. A. (eds), Handbook of Metaheuristics, pp. 287-319.
    • [12] Kolodner, J. Case-Based Reasoning. Morgan Kaufmann Publishers, Inc. San Mateo.
    • [13] MacCarthy, B. and Jou, P. Case-based reasoning in scheduling. In M. K. Khan, C. S. Wright (Eds.), Proceedings of the Symposium on Advanced Manufacturing Processes, Systems and Techniques. (AMPST96), MEP Publications, 1996, pp. 211-218.
    • [14] Miyashita, K., Sycara, K. CABINS: a framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair. Artificial Intelligence 76 (1995) pp 377-426.
    • [15] Wren, A. Scheduling, timetabling and rostering - A special relationship?. In [7], pp. 46- 75.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article