October 10, 2019 Conference paper Open Access

Máté Pintér; Balázs Dávid

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Máté Pintér</dc:creator>
  <dc:creator>Balázs Dávid</dc:creator>
  <dc:date>2019-10-10</dc:date>
  <dc: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.</dc:description>
  <dc:description>Pages 27-30</dc:description>
  <dc:identifier>https://zenodo.org/record/3522620</dc:identifier>
  <dc:identifier>10.26493/978-961-7055-82-5</dc:identifier>
  <dc:identifier>oai:zenodo.org:3522620</dc:identifier>
  <dc:relation>info:eu-repo/grantAgreement/EC/H2020/739574/</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/isbn/978-961-7055-82-5</dc:relation>
  <dc:relation>url:https://zenodo.org/communities/innorenew</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:subject>University course timetabling</dc:subject>
  <dc:subject>Local search</dc:subject>
  <dc:subject>Heuristic</dc:subject>
  <dc:title>A two-stage heuristic for the university course timetabling problem</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>