Planned intervention: On Wednesday June 26th 05:30 UTC Zenodo will be unavailable for 10-20 minutes to perform a storage cluster upgrade.
Published October 10, 2019 | Version v1
Conference paper Open

A two-stage heuristic for the university course timetabling problem

  • 1. University of Szeged, Institute of Informatics
  • 2. InnoRenew CoE; University of Primorska

Description

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.

Notes

Pages 27-30

Files

A two-stage heuristic.pdf

Files (377.8 kB)

Name Size Download all
md5:6a9ef24d369a4ad3df310e7faecc5f12
377.8 kB Preview Download

Additional details

Identifiers

ISBN
978-961-7055-82-5

Funding

InnoRenew CoE – Renewable materials and healthy environments research and innovation centre of excellence 739574
European Commission