October 10, 2019 Conference paper Open Access

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

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://zenodo.org/record/3522620</identifier>
  <creators>
    <creator>
      <creatorName>Máté Pintér</creatorName>
      <affiliation>University of Szeged, Institute of Informatics</affiliation>
    </creator>
    <creator>
      <creatorName>Balázs Dávid</creatorName>
      <affiliation>InnoRenew CoE; University of Primorska</affiliation>
    </creator>
  </creators>
  <titles>
    <title>A two-stage heuristic for the university course timetabling problem</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2019</publicationYear>
  <subjects>
    <subject>University course timetabling</subject>
    <subject>Local search</subject>
    <subject>Heuristic</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2019-10-10</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="isbn">978-961-7055-82-5</alternateIdentifier>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/3522620</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.26493/978-961-7055-82-5</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsPartOf">https://zenodo.org/communities/innorenew</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;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.&lt;/p&gt;</description>
    <description descriptionType="Other">Pages 27-30</description>
  </descriptions>
  <fundingReferences>
    <fundingReference>
      <funderName>European Commission</funderName>
      <funderIdentifier funderIdentifierType="Crossref Funder ID">10.13039/501100000780</funderIdentifier>
      <awardNumber awardURI="info:eu-repo/grantAgreement/EC/H2020/739574/">739574</awardNumber>
      <awardTitle>Renewable materials and healthy environments research and innovation centre of excellence</awardTitle>
    </fundingReference>
  </fundingReferences>
</resource>