Abstract
We describe the General Examination/Lecture Timetabling Problem (GELTP), which covers a very broad range of real problems faced continually in educational institutions, and we describe how Evolutionary Algorithms (EAs) can be employed to effectively address arbitrary instances of the GELTP. Some benchmark GELTPs are described, including real and randomly generated problems. Results are presented for several of these benchmarks, and several research and implementation issues concerning EAs in timetabling are discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abramson D., Abela, J.: A Parallel Genetic Algorithm for Solving the School Timetabling Problem. IJCAI workshop on Parallel Processing in AI, Sydney, August 1991
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, pages 55–59
Corne, D., Fang H-L., Mellish, C.: Solving the Module Exam Scheduling Problem with Genetic Algorithms. Proceedings of the Sixth International Conference in Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Chung, Lovegrove and Ali (eds.), 1993, pages 370–373.
Eiben, A.E., Raue, P.E., Ruttkay, Z Heuristic Genetic Algorithms for Constrained Problems. Working papers of the Dutch AI Conference, 1993, Twente, pages 341–353.
Corne, D., Ross, P., and Fang, H-L.; Fast Practical Evolutionary Timetabling. Proceedings of the AISB Workshop on Evolutionary Computation, Springer Verlag, 1994, to appear.
Horn, J., and Nafpliotis, N.: Multiobjective Optimisation Using The Niched Pareto Genetic Algorithm. Illinois Genetic Algorithms Laboratory (IlliGAL) Technical Report No. 93005, July 1993.
Ling, S-E.: Intergating Genetic Algorithms with a Prolog Assignment Problem as a Hybrid Solution for a Polytechnic Timetable Problem. Parallel Problem Solving from Nature 2, Elsevier Science Publisher B.V., Manner and Manderick (eds.), 1992, pages 321–329.
Paechter, B. Optimising a Presentation Timetable Using Evolutionary Algorithms. Proceedings of the AISB Workshop on Evolutionary Computation, Springer Verlag, 1994, to appear.
Ross, P., Corne, D., and Fang, H-L.: Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation.: Proceedings of PPSN III, Jerusalem, October 1994, Springer Verlag, to appear.
Smith, A.E., and Tate, D. M.: Genetic Optimisation Using a Penalty Function. Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo: Morgan Kauffman, S. Forrest (ed), 1993, pages 499–503.
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of operations research, Volume 64, 1993, pages 278–285.
Wilson, R. J.: Introduction to Graph Theory. Longman, London, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corne, D., Ross, P., Fang, HL. (1994). Fast practical evolutionary timetabling. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1994. Lecture Notes in Computer Science, vol 865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58483-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-58483-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58483-4
Online ISBN: 978-3-540-48999-3
eBook Packages: Springer Book Archive