Automated generation of constructive ordering heuristics for educational timetabling

Pillay, Nelishia and Özcan, Ender (2017) Automated generation of constructive ordering heuristics for educational timetabling. Annals of Operations Research . ISSN 1572-9338 (In Press)

[img] PDF - Repository staff only until 4 September 2018. - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (296kB)

Abstract

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.

Item Type: Article
Additional Information: The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-017-2625-x
Keywords: Educational timetabling; Construction heuristics; Hyper-heuristics; Genetic programming; Genetic algorithms
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: 10.1007/s10479-017-2625-x
Depositing User: Ozcan, Dr Ender
Date Deposited: 08 Sep 2017 10:19
Last Modified: 09 Sep 2017 02:58
URI: http://eprints.nottingham.ac.uk/id/eprint/45567

Actions (Archive Staff Only)

Edit View Edit View