Automated generation of constructive ordering heuristics for educational timetabling

dc.contributor.authorPillay, Nelishia
dc.contributor.authorÖzcan, Ender
dc.date.accessioned2017-10-17T11:08:42Z
dc.date.issued2019-04
dc.description.abstractConstruction 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.en_ZA
dc.description.departmentComputer Scienceen_ZA
dc.description.embargo2020-04-01
dc.description.librarianhj2017en_ZA
dc.description.sponsorshipA Royal Society Newton International Interchange Grant (NI150199).en_ZA
dc.description.urihttp://link.springer.com/journal/10479en_ZA
dc.identifier.citationPillay, N. & Özcan, E. Automated generation of constructive ordering heuristics for educational timetabling. Annals of Operations Research (2019) 275: 181-208. https://doi.org/10.1007/s10479-017-2625-xen_ZA
dc.identifier.issn0254-5330 (print)
dc.identifier.issn1572-9338 (online)
dc.identifier.other10.1007/s10479-017-2625-x
dc.identifier.urihttp://hdl.handle.net/2263/62814
dc.language.isoenen_ZA
dc.publisherSpringeren_ZA
dc.rights© 2017 Springer Science+Business Media, LLC. The original publication is available at : http://link.springer.comjournal/10479.en_ZA
dc.subjectConstruction heuristicsen_ZA
dc.subjectEducational timetablingen_ZA
dc.subjectGenetic algorithmsen_ZA
dc.subjectGenetic programmingen_ZA
dc.subjectHyper-heuristicsen_ZA
dc.titleAutomated generation of constructive ordering heuristics for educational timetablingen_ZA
dc.typePostprint Articleen_ZA

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Pillay_Automated_2019.pdf
Size:
289.83 KB
Format:
Adobe Portable Document Format
Description:
Postprint Article

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.75 KB
Format:
Item-specific license agreed upon to submission
Description: