Automated generation of constructive ordering heuristics for educational timetabling
- 192 Downloads
Construction heuristics play an important role in solving combinatorial optimization problems. These heuristics are usually used to create an initial solution to the problem which is improved using optimization techniques such as metaheuristics. For examination timetabling and university course timetabling problems essentially graph colouring heuristics have been used for this purpose. The process of deriving heuristics manually for educational timetabling is a time consuming task. Furthermore, according to the no free lunch theorem different heuristics will perform well for different problems and problem instances. Hence, automating the induction of construction heuristics will reduce the man hours involved in creating such heuristics, allow for the derivation of problem specific heuristics and possibly result in the derivation of heuristics that humans have not thought of. This paper presents generation construction hyper-heuristics for educational timetabling. The study investigates the automatic induction of two types of construction heuristics, namely, arithmetic heuristics and hierarchical heuristics. Genetic programming is used to evolve arithmetic heuristics. Genetic programming, genetic algorithms and the generation of random heuristic combinations is examined for the generation of hierarchical heuristics. The hyper-heuristics generating both types of heuristics are applied to the examination timetabling and the curriculum based university course timetabling problems. The evolved heuristics were found to perform much better than the existing graph colouring heuristics used for this domain. Furthermore, it was found that the while the arithmetic heuristics were more effective for the examination timetabling problem, the hierarchical heuristics produced better results than the arithmetic heuristics for the curriculum based course timetabling problem. Genetic algorithms proved to be the most effective at inducing hierarchical heuristics.
KeywordsEducational timetabling Construction heuristics Hyper-heuristics Genetic programming Genetic algorithms
The authors would like to thank the reviewers for their helpful comments to improve the quality of the paper. The facilities made available by the Centre for High Performance Computing (CHPC) in South Africa and University of Nottingham High Performance Computing facility to run simulations for the experiments is acknowledged.
- Beasley, J. (1990). Or-library. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/tableinfo.html.
- Hyde, M. A. (2010). Genetic programming hyper-heuristic approach to automated packing. Ph.D. thesis, School of Computer Science.Google Scholar
- Koza, J. (1992). Genetic programming: On the programming of computers by means of natural selection (1st ed.). Cambridge: MIT.Google Scholar
- Özcan, E., & Parkes, A. (2011). Policy matrix evolution for generation of heuristics. In Proceedings of the 13th annual conference on genetic and evolutionary computation (pp. 2011–2018).Google Scholar
- Pillay, N. (2009). Evolving hyper-heuristics for the uncapacitated examination timetabling problem. In Proceedings of the multidisciplinary international conference on scheduling (pp. 409–422).Google Scholar
- Pillay, N. (2011). Evolving heuristics for the school timetabling problem. In Proceedings of the 2011 IEEE conference on intelligent computing and intelligent systems (ICIS 2011), vol. 3, (pp. 281–286). IEEE.Google Scholar
- Sim, K., & Hart, E. A. (2016). combined generative and selective hyper-heuristic for the vehicle routing problem. In Proceedings of the genetic and evolutionary computation conference (GECCO ’16) (pp. 1093–1100). ACM.Google Scholar