Conference paper Open Access

A two-stage heuristic for the university course timetabling problem

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


JSON-LD (schema.org) Export

{
  "description": "<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>", 
  "license": "https://creativecommons.org/licenses/by/4.0/legalcode", 
  "creator": [
    {
      "affiliation": "University of Szeged, Institute of Informatics", 
      "@type": "Person", 
      "name": "M\u00e1t\u00e9 Pint\u00e9r"
    }, 
    {
      "affiliation": "InnoRenew CoE; University of Primorska", 
      "@type": "Person", 
      "name": "Bal\u00e1zs D\u00e1vid"
    }
  ], 
  "headline": "A two-stage heuristic for the university course timetabling problem", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2019-10-10", 
  "url": "https://zenodo.org/record/3522620", 
  "keywords": [
    "University course timetabling", 
    "Local search", 
    "Heuristic"
  ], 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.26493/978-961-7055-82-5", 
  "@id": "https://doi.org/10.26493/978-961-7055-82-5", 
  "@type": "ScholarlyArticle", 
  "name": "A two-stage heuristic for the university course timetabling problem"
}
63
58
views
downloads
Views 63
Downloads 58
Data volume 21.9 MB
Unique views 61
Unique downloads 57

Share

Cite as