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

Kheiri, Ahmed ORCID: https://orcid.org/0000-0002-6716-2130, Ö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. 10.1007/s10479-014-1660-0

Preview

PDF - Accepted Post-Print Version Download (538kB) | Preview

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Publisher:	Springer Verlag
ISSN:	0254-5330
Date of First Compliant Deposit:	30 March 2016
Last Modified:	19 Nov 2024 11:45
URI:	https://orca.cardiff.ac.uk/id/eprint/85713

Citation Data

Cited 20 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item