Abstract
This paper describes extensions to an evolutionary algorithm that timetables classes for an entire University. A new method of dealing with multi-objectives is described along with a user interface designed for it. New results are given concerning repair of poor recombination choices during local search. New methods are described and evaluated that allow timetables to be produced which have minimal changes compared to a full or partial reference timetable. The paper concludes with a discussion of scale-up issues, and gives some initial results that are very encouraging.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Burke, E. K., Elliman D., and Weare, R., “A Genetic Algorithm for University Timetabling” AISB Workshop on Evolutionary Computing, Leeds, 1994.
Burke, E. K., Elliman, D. and Weare, R., “Specialised Recombinative Operators for Timetabling Problems”, Proceedings of the AISB Workshop in Evolutionary Computing, Springer-Verlag Lecture Notes in Computer Science Series No 993, Heidleberg, 1995.
Burke, E. K., Newall, J. P. and Weare, R. F. “A Memetic Algorithm for University Exam Timetabling”, Practice and Theory of Automated Timetabling, Burke and Ross Eds. Springer Verlag, 1996.
Caldeira, J. P., and Agostinho, C. R., “School Timetabling Using Genetic Search”, Practice and Theory of Automated Timetabling, Toronto, 1997.
Carter, M. and Laporte, G. “Recent Developments in Practical Course Timetabling”, Practice and Theory of Automated Timetabling, Toronto, 1997.
Colorni, A., Dorigo M., Maniezzo, V. “Genetic Algorithms and Highly Constrained Problems: The Time-Table Case”. Parallel Problem Solving from Nature I, Goos and Hartmanis (eds.) Springer-Verlag, Heidelberg, 1990.
Corne, D., Ross, P. and Fang, H., “Fast Practical Evolutionary Timetabling” Proceedings of the AISB Workshop on Evolutionary Computing, Springer-Verlag Lecture Notes in Computer Science Series No. 865, Heidelberg, 1994.
Corne, D., and Ogden, Rev. J., “Evolutionary Optimisation of Methodist Preaching Timetables”, Practice and Theory of Automated Timetabling, Toronto, 1997.
Eiben, A.E., Raue, P. E. and Ruttkay, Z. “Heuristic Genetic Algorithms for Constrained Problems”. Working Papers for the Dutch AI Conference, Twente, 1993.
Mamede, N. and Renta, T, “Repairing University Timetables Using Genetic Algorithms and Simulated Annealing”, Practice and Theory of Automated Timetabling, Toronto, 1997.
Paechter, B., Luchian, H., and Cumming, A., “An Evolutionary Approach to the General Timetable Problem”, The Scientific Annals of the “Al. I. Cuza” University of Iasi, special issue for the ROSYCS symposium 1993.
Paechter B., Luchian H., Cumming A., and Petriuc M., “Two Solutions to the General Timetable Problem Using Evolutionary Methods”, The Proceedings of the IEEE Conference of Evolutionary Computation, 1994.
Paechter, B., Cumming, A., Luchian, H., ”The Use of Local Search Suggestion Lists for Improving the Solution of Timetable Problems with Evolutionary Algorithms.”, Proceedings of the AISB Workshop in Evolutionary Computing, Springer-Verlag Lecture Notes in Computer Science Series No 993, Heidleberg, 1995.
Paechter, B., Cumming, A., Norman, M., and Luchian, H., “Extensions to a Memetic Timetabling System”, Practice and Theory of Automated Timetabling, Burke and Ross Eds. Springer Verlag, 1996.
Paechter, B., Rankin, R. C. and Cumming A, “Improving a Lecture Timetabling System for University Wide Use”, Practice and Theory of Automated Timetabling, Toronto, 1997.
Radcliffe, N. J. “Forma Analysis and Random Respectful Recombination” Proceedings of the Fourth International Conference on Genetic Algorithms”, Morgan-Kaufmann, 1991.
Ross, P., Corne, D., and Fang, H., “Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation”, Parallel Problem Solving from Nature III, Springer-Verlag, Heidelberg, 1994.
Ross, P. and Corne, D. “Comparing Genetic Algorithms, Simulated Annealing, and Stochastic Hillclimbing on Several Real Timetable Problems”, Proceedings of the AISB Workshop in Evolutionary Computing, Springer-Verlag Lecture Notes in Computer Science Series No 993, Heidleberg, 1995.
Ross, P., Corne D. and Terashima H., “The Phase Transition Niche for Evolutionary Algorithms in Timetabling” Practice and Theory of Automated Timetabling, Burke and Ross Eds. Springer Verlag, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paechter, B., Rankin, R.C., Cumming, A., Fogarty, T.C. (1998). Timetabling the classes of an entire university with an evolutionary algorithm. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056928
Download citation
DOI: https://doi.org/10.1007/BFb0056928
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive