Máté Pintér
Balázs Dávid
2019-10-10
<p>This paper presents a two-stage solution method for the curriculum-based university course timetabling problem. First, an initial solution is created using a recursive search algorithm, then its quality is improved with a local search heuristic. This method utilizes a tabu list of forbidden transformations, as well as a destructive step at the end of each iteration. The algorithm is tested on datasets of the 2007 International Timetabling Competition.</p>
Pages 27-30
https://doi.org/10.26493/978-961-7055-82-5
oai:zenodo.org:3522620
isbn:978-961-7055-82-5
Zenodo
https://zenodo.org/communities/innorenew
https://zenodo.org/communities/eu
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
University course timetabling
Local search
Heuristic
A two-stage heuristic for the university course timetabling problem
info:eu-repo/semantics/conferencePaper