Abstract
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of feasibility. That is that there are no conflicts and no overfilled rooms. Various approaches to solving the timetabling problem using evolutionary computing methods are first compared. The recombination operators are then presented and various alternatives for incorporating heuristic knowledge in the search are described. Finally, results are presented comparing the operators on a real timetabling problem.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D Abramson and J Abela, (1991) ‘A parallel genetic algorithm for solving the school timetabling problem”, Technical report, Division of Information Technology, C.S.I.R.O., April 1991.
Boizumault P., Gueret C. and Jussien N. (1994) “Efficient Labelling and Constraint Relaxation for Solving Time Tabling Problems” International Logic Programming Symposium — Workshop on Constraint Languages and their use in Problem Modelling. pp116–130
Bruns R. (1993) “Knowledge-Augmented Genetic Algorithm for Production Scheduling”, IJCAI '93 Workshop on Knowledge based Production Planning, Scheduling and Control.
EK Burke, DG Elliman, and RF Weare, (1995) “A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems,” 6th International Conference on Genetic Algorithms (Pittsburgh, USA, 15–19 July 1995).
Burke E.K., Elliman D.G. and Weare R.F. (1994) “A University Timetabling System Based on Graph Colouring and Constraint Manipulation”, Journal of Research on Computing in Education. Vol. 27. issue 1, pp1–18.
EK Burke, DG Elliman, and RF Weare, (1995) “ Examination Timetabling in British Universities — A Survey”, to appear in proceedings of the 1st International Conference on the Practice and Theory of Automated Timetabling (ICPTAT'95, Napier University, Edinburgh, 30th Aug–1st Sept dy1995).
EK Burke, JP Newall, and RF Weare, (1995) “A Memetic Algorithm for University Exam Timetabling” to appear in proceedings of the 1st International Conference on the Practice and Theory of Automated Timetabling (ICPTAT'95, Napier University, Edinburgh, 30th Aug–1st Sept 1995).
Colorni, A., Dorigo, M., Maniezzo, V. (1990) “Genetic Algorithms and Highly Constrained Problems; The Timetable Case”, Parallel Problem Solving from Nature I, Springer-Verlag, pp.55–59.
Carter M.W. (1986) “A Survey of Practical Applications of Examination Timetabling Algorithms” OR Practice 34, pp 193–202.
D Corne, HL Fang, and C Mellish, (1993) “Solving the Modular Exam Scheduling Problem with Genetic Algorithms,” Proceedings of the 6th International Conference in Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, pp. 370–373, Gordon and Breach Science Publishers.
Corne, D., Ross,P.,Fang H-L (1994) “Fast Practical Evolutionary timetabling”, Lecture Notes in Computer Science 865, Springer-Verlag, pp250–263.
D Corne, P Ross, and HL Fang, (1994) “Evolutionary Timetabling: Practice, Prospects and work in Prgoress”, in the proceedings of the UK Planning and Scheduling SIG Workshop, Strathclyde, September 1994.
Davis L. (1991) “Handbook of Genetic Algorithms” Van Nostrand Reinhold
Davis L. and Ritter F. (1987) “Schedule Optimization with Probabilistic Search” Proceedings of the 3rd IEEE Conference on Artificial Intelligence Applications, February 1987, Orlando, Florida, USA, pp231–236.
Hancock P.J.B. (1994) “An empirical Comparison of Selection Methods in Evolutionary Algorithms”, Lecture Notes in Computer Science 865, Springer-Verlag, pp80–94
Johnson D.S., Aragon C.R., McGeoch L.A. and Schevon C. (1991) “Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning” Operations Research 39, pp378–406.
Kang L. and White G.M. (1992) “A Logic Approach to the Resolution of Constraints in Timetabling” European Journal of Operational Research 61 pp306–317.
Ling, S.E. (1992) “Integrating Genetic Algorithms with a Prolog Assignment Problem as a Hybrid Solution for a Polytechnic Timetable Problem”, Parallel Problem Solving from Nature II, Elsevier Science Publisher. pp321–329.
Paechter B., Cumming A., Luchian H. and Petriuc M. (1994) “Two Solutions to the General Timetable Problem Using Evolutionary Methods” In the proceedings of the 1994 IEEE Conference on Evolutionary Computing
J. Thompson and KA Dowsland, (1993) “Multi-Objective University Examination Scheduling,” EBMS/1993/12, European Business Management School, Swansea University, UK.
Tripathy A. (1984) “School Timetabling — A case in Large Binary Integer Linear Programming” Discrete Applied Mathematics 35.3 pp313–323.
Radcliffe N.J. and Surry P.D. (1994) “Formal Memetic Algorithms”, Lecture Notes in Computer Science 865, Springer-Verlag, pp1–16.
P Ross, D Corne and HL Fang, “Improving evolutionary timetabling with delta evaluation and directed mutation”, in Parallel Problem Solving from Nature III, ed. Y.Davidor, Springer-Verlag, 1994.
Welsh D.J.A. and Powell M.B. (1967) “An Upper bound for the Chromatic Number of a Graph and Its Application to Timetabling Problems” Comp. Jrnl. 10, pp85–86.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burke, E., Elliman, D., Weare, R. (1995). Specialised recombinative operators for timetabling problems. 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_26
Download citation
DOI: https://doi.org/10.1007/3-540-60469-3_26
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