3522620
doi
10.26493/978-961-7055-82-5
oai:zenodo.org:3522620
user-innorenew
user-eu
Balázs Dávid
InnoRenew CoE; University of Primorska
A two-stage heuristic for the university course timetabling problem
Máté Pintér
University of Szeged, Institute of Informatics
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
<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
Zenodo
2019-10-10
info:eu-repo/semantics/conferencePaper
3522619
user-innorenew
user-eu
award_title=Renewable materials and healthy environments research and innovation centre of excellence; award_number=739574; award_identifiers_scheme=url; award_identifiers_identifier=https://cordis.europa.eu/projects/739574; funder_id=00k4n6c32; funder_name=European Commission;
1579537429.966548
377783
md5:6a9ef24d369a4ad3df310e7faecc5f12
https://zenodo.org/records/3522620/files/A two-stage heuristic.pdf
public