10.26493/978-961-7055-82-5
https://zenodo.org/records/3522620
oai:zenodo.org:3522620
978-961-7055-82-5
Máté Pintér
Máté Pintér
University of Szeged, Institute of Informatics
Balázs Dávid
Balázs Dávid
InnoRenew CoE; University of Primorska
A two-stage heuristic for the university course timetabling problem
Zenodo
2019
University course timetabling
Local search
Heuristic
2019-10-10
https://zenodo.org/communities/innorenew
https://zenodo.org/communities/eu
Creative Commons Attribution 4.0 International
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.
Pages 27-30
European Commission
10.13039/501100000780
739574
Renewable materials and healthy environments research and innovation centre of excellence