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

Kheiri, Ahmed and Özcan, Ender and Parkes, Andrew J. (2016) A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Annals of Operations Research, 239 (1). pp. 135-151. ISSN 0254-5330

[thumbnail of ITC2011]
PDF (ITC2011)
ITC2011.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (538kB)


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.

Item Type:
Journal Article
Journal or Publication Title:
Annals of Operations Research
Additional Information:
The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-014-1660-0
Uncontrolled Keywords:
?? hyper-heuristicrestartschedulingstochastic local searchtimetablingdecision sciences(all)management science and operations research ??
ID Code:
Deposited By:
Deposited On:
21 Nov 2017 20:08
Last Modified:
20 Apr 2024 01:52