Abstract
Examination timetabling problems are traditionally solved by choosing a solution procedure from a plethora of heuristic algorithms based either on a direct construction principle or on some incremental improvement procedure. A number of hybrid approaches have also been examined in which a sequential heuristic and a metaheuristic are employed successively. As a rule, best results for a problem instance are obtained by implementing heuristics with domain-specific knowledge. However, solutions of this kind are not easily adoptable across different problem classes. In order to lessen the need for a problem-specific knowledge we developed a novel solution approach to examination timetabling by incorporating the case-based reasoning methodology. A solution to a given problem is constructed by implementing case-based reasoning to select a sequential heuristic, which produces a good initial solution for the Great Deluge metaheuristic. A series of computational experiments on benchmark problems were conducted which subsequently demonstrate that this approach gives comparable or better results than solutions generated not only by a single Great Deluge algorithm, but also the state-of-the-art approaches.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Aamodt, A. and Plaza, P. (1994) Case-based reasoning: foundational issues, methodological variations and system approaches. The European Journal on Artificial Intelligence, 7:39–59.
Brelaz, D. (1979) New methods to color the vertices of a graph. Communication of ACM, 22:251–256.
Burke, E. K. and Newell, J. P. (1999) A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation, 31:63–74.
Burke, E. K. and Newall, J. P. (2002) Enhancing Timetable Solutions with Local Search Methods. In The Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740, Springer, Berlin, pp. 195–206.
Burke, E. K. and Newell, J. P. (2003) Solving examination timetabling problems through adaptation of heuristic orderings. Annals of Operations Research, accepted for publication.
Burke, E. K. and Petrovic, S. (2002) Recent research directions in automated timetabling. European Journal of Operational Research, 140:266–280.
Burke, E. K., Elliman, D. G., Ford, P. H. and Weare, R. F. (1996) Examination timetabling in british universities—A survey. In The Practice and Theory of Automated Timetabling I, Lecture Notes in Computer Science, Vol. 1153, Springer, Berlin, pp. 76–92.
Burke, E. K., Newall, J. P. and Weare, R. F. (1998) Initialisation strategies and diversity in evolutionary timetabling. Evolutionary Computation Journal, 6:81–103.
Burke, E. K., Newell, J. P. and Weare, R. F. (1998) 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, pp. 574–579.
Burke, E. K., MacCarthy, B., Petrovic, S. and Qu, R. (2001) Case-based reasoning in course timetabling: an attribute graph approach. In Proceedings of 4th International Conference on Case-Based Reasoning, Lecture Notes in Artificial Intelligence, Vol. 2080, Springer, Berlin, pp. 90–104.
Burke, E. K., Hart, E., Kendall, G., Newall, J., Ross, P. and Schulenburg, S. (2003a) Hyper-heuristics: an emerging direction in modern search technology. In Handbook of Meta-Heuristics, Chapter 16, pp. 457–474, Kluwer, Dordrecht.
Burke, E. K., Bykov, Y., Newall, J. P. and Petrovic, S. (2003b) A time-predefined local search approach to exam timetabling problems. HlE Transactions on Operations Engineering, 36:509–528.
Carter, M. W. (1986) A survey of practical applications on examination timetabling. Operations Research, 34:193–202.
Carter, M. W. and Laporte, G. (1996) Recent developments in practical examination timetabling. In The Practice and Theory of Automated Timetabling I, Lecture Notes in Computer Science, Vol. 1153, Springer, Berlin, pp. 3–21.
Carter, M. W., Laporte, G. and Chinneck, J. W. (1994) A general examination scheduling system. Interfaces, 24:109–120.
Carter, M. W., Laporte, G. and Lee, S. Y. (1996) Examination timetabling: algorithmic strategies and applications. Journal of the Operational Research Society, 47:373–383.
Casey, S. and Thompson, J. (2003) GRASPing the examination scheduling problem. In The Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740, Springer, Berlin, pp. 232–246.
Coello, J. M. A. and Santos, R. C. (1999) Integrating CBR and heuristic search for learning and reusing solutions in real-time task scheduling. In Proceedings of 3rd International Conference on Case-Based Reasoning, Lecture Notes in Artificial Intelligence, Vol. 1650, Springer, Berlin, pp. 89–103.
Di Gaspero, L. and Schaerf, A. (2001) Tabu search techniques for examination timetabling. In Proceedings of Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science, Vol. 2079, Springer, Berlin, pp. 104–117.
Dueck, G. (1993) New optimization heuristics. Journal of Computational Physics, 104:86–92.
Foxley, E. and Lockyer, K. (1968) The construction of examination timetable by computer. The Computer Journal, 11:264–268.
Garey, M. R. and Johnson, D. S. (1977) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
Gendreau, M., Soriano, P. and Salvail, L. (1993) Solving the maximum clique problem using a tabu search approach. Annals of Operations Research, 41:385–403.
Glover, F. and Laguna, M. (1997) Tabu Search. Kluwer, Dordrecht.
Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P. (1983) Optimisation by simulated annealing. Science, 220:671–680.
Laporte, G. and Desroches, S. (1984) Examination timetabling by computer. Computers and Operations Research, 11:351–360.
Leake, D. B. (1996) CBR in context: the present and future. In Case-Based Reasoning: Experiences, Lessons, and Future Directions, D. Leake (Ed.), AAAI Press/MIT Press, Menlo Park, CA.
Luo, B. and Hancock, E. R. (2001) Structural graph matching using the em algorithm and singular value decomposition. IEEE Transactions Analysis and Machine Intelligence, 23:1120–1136.
Kolodner, J. (1993) Case-Based Reasoning. Morgan Kaufmann, San Mateo, CA.
Merlot, L. T. G., Boland, N., Hughs, B. and Stucky, P. J. (2003) A hybrid algorithm for the examination timetabling problem. In The Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740, Springer, Berlin, pp. 207–231.
Miyashita, K. and Sycara, K. (1995) CABINS: A framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair. Artificial Intelligence, 76:377–426.
Petrovic, S. and Qu, R. (2002) Case-based reasoning as a heuristic selector in a hyper-heuristic for course timetabling problems. In Proceedings of Knowledge-Based Intelligent Information Engineering Systems and Allied Technologies, Frontiers in Artificial Intelligence and Applications, Vol. 82, IOS Press, Amsterdam, pp. 336–340.
Petrovic, S., Kendall, G. and Yang, Y. (2002) A tabu search approach for graph-structured case retrieval. In Proceedings of the STarting Artificial Intelligence Researchers Symposium, IOS Press, Amsterdam, pp. 55–64.
Petrovic, S., Beddoe, G. R. and Berghe, G. V. (2003a) Storing and adapting repair experiences in employee rostering. In Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740, Springer, Berlin, pp. 149–166.
Petrovic, S., Yang, Y. and Dror, M. (2003b) Case-based initialisation of metaheuristics for examination timetabling. In Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 137–155.
Saleh Elmohamed, M. A., Coddington, P. and Fox, G. (1998) A comparison of annealing techniques for academic course scheduling. In The Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science, Vol. 1408, Springer, Berlin, pp. 92–112.
Schirmer, A. 2000 Case-based reasoning and improved adaptive search for project scheduling. Naval Research Logistics, 47:201–222.
Terashima-Marín, H., Ross, P. and Valenzuela-Rendón, M. (1999) Evolution of constraint satis-faction strategies in examination timetabling. In Proceedings of the Genetic and Evolutionary Conference, pp. 635–642.
Wang, Y. and Ishii, N. (1997) A method of similarity metrics for structured representations. Expert Systems with Applications, 12:89–100.
Welsh, D. J. A. and Powell, M. B. (1967) An upper bound on the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10:85–86.
White, G. M. Xie, B. S. and Zonjic, S. (2004) Using tabu search with longer-term memory and relaxation to create examination timetables. European Journal of Operational Research, 153:80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Petrovic, S., Yang, Y., Dror, M. (2005). Case-Based Initialisation of Metaheuristics for Examination Timetabling. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/0-387-27744-7_14
Download citation
DOI: https://doi.org/10.1007/0-387-27744-7_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25266-7
Online ISBN: 978-0-387-27744-8
eBook Packages: Business and EconomicsBusiness and Management (R0)