Skip to main content

Research Repository

Advanced Search

A stochastic local search algorithm with adaptive acceptance for high-school timetabling

Kheiri, Ahmed; Özcan, Ender; Parkes, Andrew J.

Authors

Ahmed Kheiri

Ender Özcan exo@cs.nott.ac.uk

Andrew J. Parkes



Abstract

Automating high school timetabling is a challenging task. This problem is a well known hard computational problem which has been of interest to practitioners as well as researchers. High schools need to timetable their regular activities once per year, or even more frequently. The exact solvers might fail to find a solution for a given instance of the problem. A selection hyper-heuristic can be defined as an easy-to-implement, easy-to-maintain and effective 'heuristic to choose heuristics' to solve such computationally hard problems. This paper describes the approach of the team hyper-heuristic search strategies and timetabling (HySST) to high school timetabling which competed in all three rounds of the third international timetabling competition. HySST generated the best new solutions for three given instances in Round 1 and gained the second place in Rounds 2 and 3. It achieved this by using a fairly standard stochastic search method but significantly enhanced by a selection hyper-heuristic with an adaptive acceptance mechanism. © 2014 Springer Science+Business Media New York.

Journal Article Type Article
Publication Date 2016-04
Journal Annals of Operations Research
Print ISSN 0254-5330
Electronic ISSN 1572-9338
Publisher Springer Verlag
Peer Reviewed Peer Reviewed
Volume 239
Issue 1
Pages 135-151
APA6 Citation Kheiri, A., Özcan, E., & Parkes, A. J. (2016). A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Annals of Operations Research, 239(1), 135-151. https://doi.org/10.1007/s10479-014-1660-0
DOI https://doi.org/10.1007/s10479-014-1660-0
Keywords timetabling, stochastic local search, hyper-heuristic, restart, scheduling
Publisher URL http://link.springer.com/article/10.1007%2Fs10479-014-1660-0
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf
Additional Information The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-014-1660-0

Files

mainITC2011.pdf (534 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;