A memetic algorithm for university exam timetabling
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a significant increase in its complexity, imposing even more difficulties on university administrators who must find a solution, often without any computer aid.
Of the many methods that have been applied to solving the problem automatically, evolutionary techniques have shown much promise due to their general purpose optimisation capabilities. However, it has also been found that hybrid evolutionary methods can yield even better results. In this paper we present such a hybrid approach in the form of an evolutionary algorithm that incorporates local search methods (known as a memetic algorithm).
KeywordsGenetic Algorithm Local Search Memetic Algorithm Roulette Wheel Timetabling Problem
Unable to display preview. Download preview PDF.
- 1.Peter Ross, Dave Corne: Improving evolutionary timetabling with delta evaluation and directed mutation. Parallel Problem Solving in Nature III, Ed. Y. Davidor, Springer Verlag, (1994)Google Scholar
- 2.E. K. Burke, D. G. Elliman, R. F. Weare: Examination Timetabling in British Universities — A Survey. Proceedings of the 1st International Conference on the Practice and Theory of Automated Timetabling, (Napier University, Edinburgh, UK) (1995)Google Scholar
- 3.E. K. Burke, D. G. Elliman, R. F. Weare: Specialised Recombinative Operators for Timetabling Problems. Lecture Notes in Computer Science 993 (Evolutionary Computing), Springer-Verlag, Ed. T. C. Fogarty, 1995, pp 75–85Google Scholar
- 4.E. K. Burke, D. G. Elliman, R. F. Weare: A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems. 6th International Conference on Genetic Algorithms (Pittsburgh, USA), 15–19 July 1995Google Scholar
- 5.Peter Ross, Dave Corne: Applications of Genetic Algorithms. AISB Quarterly 89, Ed. T.C. Fogarty, (1994), 23–30Google Scholar
- 6.Dave Corne, Peter Ross, Hsiao-Lan Fang: Fast Practical Evolutionary Timetabling, Lecture Notes in Computer Science 865 (Evolutionary Computing), Springer-Verlag, Ed T. C. Fogarty, (1994), 250–263Google Scholar
- 7.Nicholas J. Radcliffe, Patrick D. Surry: Formal Memetic Algorithms. Lecture Notes in Computer Science 865 (Evolutionary Computing) Springer-Verlag, Ed. T. C. Fogarty, (1994), 250–263Google Scholar
- 8.Pablo Moscato, Michael G. Norman: A “Memetic” approach for the travelling salesman problem — implementation of a computational ecology for combinatorial optimisation on message-passing systems. Proceedings of the International Conference on Parallel computing and Transputer Applications, IOS Press (Amsterdam)Google Scholar
- 9.E.K. Burke, D.G. Elliman, R.F. Weare: Extensions to a University Exam Timetabling Systems. IJCAI '93 Workshop on Knowledge-Based Production Planning, Scheduling and Control (1993)Google Scholar
- 10.E.K. Burke, D.G. Elliman, R.F. Weare: A University Timetabling System Based on Graph Colouring and Constraint Manipulation, Journal of Research on Computing in Education, (1993)Google Scholar
- 11.EK Burke, DG Elliman, RF Weare: A Genetic Algorithm based University Timetabling System. 22nd East-West International Conference on Computer Technologies in Education (Crimea, Ukraine, 19th–23rd Sept 1994) (1994) 35–40Google Scholar
- 12.Davis L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, (1991)Google Scholar
- 13.Dawkins R.: The Selfish Gene. Oxford University Press, (1976)Google Scholar
- 14.Paechter B., Cumming A., Luchian H.: The Use of Local Search Suggestion Lists for Improving the Solution of Timetabling Problems with Evolutionary Algorithms. Lecture Notes in Computer Science 993 (Evolutionary Computing), Springer-Verlag, Ed. T. Fogarty, (1995), 86–93Google Scholar