Ahmed Kheiri
A stochastic local search algorithm with adaptive acceptance for high-school timetabling
Kheiri, Ahmed; �zcan, Ender; Parkes, Andrew J.
Authors
ENDER OZCAN ender.ozcan@nottingham.ac.uk
Professor of Computer Science and Operational Research
Dr ANDREW PARKES ANDREW.PARKES@NOTTINGHAM.AC.UK
Associate Professor
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.
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
Journal Article Type | Article |
---|---|
Acceptance Date | Apr 1, 2014 |
Online Publication Date | Jun 22, 2014 |
Publication Date | 2016-04 |
Deposit Date | Mar 9, 2016 |
Publicly Available Date | Mar 9, 2016 |
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 |
DOI | https://doi.org/10.1007/s10479-014-1660-0 |
Keywords | timetabling, stochastic local search, hyper-heuristic, restart, scheduling |
Public URL | https://nottingham-repository.worktribe.com/output/730273 |
Publisher URL | http://link.springer.com/article/10.1007%2Fs10479-014-1660-0 |
Additional Information | The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-014-1660-0 |
Contract Date | Mar 9, 2016 |
Files
mainITC2011.pdf
(534 Kb)
PDF
You might also like
Learning the Quality of Dispatch Heuristics Generated by Automated Programming
(2018)
Book Chapter
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search