Conference paper Open Access

A two-stage heuristic for the university course timetabling problem

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


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">University course timetabling</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Local search</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Heuristic</subfield>
  </datafield>
  <controlfield tag="005">20200120162349.0</controlfield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Pages 27-30</subfield>
  </datafield>
  <controlfield tag="001">3522620</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">InnoRenew CoE; University of Primorska</subfield>
    <subfield code="a">Balázs Dávid</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">377783</subfield>
    <subfield code="z">md5:6a9ef24d369a4ad3df310e7faecc5f12</subfield>
    <subfield code="u">https://zenodo.org/record/3522620/files/A two-stage heuristic.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2019-10-10</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="p">user-innorenew</subfield>
    <subfield code="o">oai:zenodo.org:3522620</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">University of Szeged, Institute of Informatics</subfield>
    <subfield code="a">Máté Pintér</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">A two-stage heuristic for the university course timetabling problem</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-innorenew</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="c">739574</subfield>
    <subfield code="a">Renewable materials and healthy environments research and innovation centre of excellence</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&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;</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.26493/978-961-7055-82-5</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="q">alternateidentifier</subfield>
    <subfield code="a">978-961-7055-82-5</subfield>
    <subfield code="2">isbn</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
</record>
62
55
views
downloads
Views 62
Downloads 55
Data volume 20.8 MB
Unique views 60
Unique downloads 54

Share

Cite as