Abstract
This paper presents a new genetic representation for timetabling with evolutionary algorithms. The representation involves the use of suggestion lists for the placement of events into timeslots. A set of recombination operators is defined for the new representation, and experimental results are given to compare the performance of the operators with each other and with a system not using suggestion lists.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Goldberg D. E., Genetic Algorithms in Search, Optimisation and Machine Learning, Addison Wesley, Reading, 1989.
Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, London, 1992.
Davis L., Handbook of Genetic Algorithms, van Nostrand Reinhold, London, 1992.
Paechter B., Luchian H., 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., Petriuc M., “Two Solutions to the General Timetable Problem Using Evolutionary Methods”, The Proceedings of the IEEE Conference of Evolutionary Computation, 1994.
Paechter B., “Optimising a Presentation Timetable Using Evolutionary Algorithms”, Proceedings of the AISB Workshop on Evolutionary Computing, Springer-Verlag Computer Science Series, 1994.
Corne D., Ross P., Fang H., “Fast Practical Evolutionary Timetabling” Proceedings of the AISB Workshop on Evolutionary Computing, Springer-Verlag Computer Science Series, 1994.
Burke E., Elliman D., Weare R., “A Genetic Algorithm for University Timetabling” AISB Workshop on Evolutionary Computing, Leeds, 1994.
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, 1990.
Abramson D., Abela J., “A Parallel Genetic Algorithm for Solving the School Timetabling Problem”, IJCAI workshop on Parallel Processing in AI, Sydney, 1991.
Radcliffe N. J., Surry P. D., “Formal Memetic Algorithms”, Proceedings of the AISB Workshop on Evolutionary Computing, Springer-Verlag Computer Science Series, 1994.
Radcliffe N. J., “Forma Analysis and Random Respectful Recombination” Proceedings of the Fourth International Conference on Genetic Algorithms”, Morgan-Kaufmann, 1991.
Orvosh D., Davis L., “Using a Genetic Algorithm to Optimize Problems with Feasibility Constraints”, The Proceedings of the IEEE Conference of Evolutionary Computation, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paechter, B., Cumming, A., Luchian, H. (1995). The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1995. Lecture Notes in Computer Science, vol 993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60469-3_27
Download citation
DOI: https://doi.org/10.1007/3-540-60469-3_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60469-3
Online ISBN: 978-3-540-47515-6
eBook Packages: Springer Book Archive