Conference paper Open Access

A two-stage heuristic for the university course timetabling problem

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


JSON Export

{
  "files": [
    {
      "links": {
        "self": "https://zenodo.org/api/files/d4dcc812-6ba6-4b62-a79b-ee3c5baf4d47/A%20two-stage%20heuristic.pdf"
      }, 
      "checksum": "md5:6a9ef24d369a4ad3df310e7faecc5f12", 
      "bucket": "d4dcc812-6ba6-4b62-a79b-ee3c5baf4d47", 
      "key": "A two-stage heuristic.pdf", 
      "type": "pdf", 
      "size": 377783
    }
  ], 
  "owners": [
    51764
  ], 
  "doi": "10.26493/978-961-7055-82-5", 
  "stats": {
    "version_unique_downloads": 47.0, 
    "unique_views": 52.0, 
    "views": 53.0, 
    "version_views": 53.0, 
    "unique_downloads": 47.0, 
    "version_unique_views": 52.0, 
    "volume": 18133584.0, 
    "version_downloads": 48.0, 
    "downloads": 48.0, 
    "version_volume": 18133584.0
  }, 
  "links": {
    "doi": "https://doi.org/10.26493/978-961-7055-82-5", 
    "latest_html": "https://zenodo.org/record/3522620", 
    "bucket": "https://zenodo.org/api/files/d4dcc812-6ba6-4b62-a79b-ee3c5baf4d47", 
    "badge": "https://zenodo.org/badge/doi/10.26493/978-961-7055-82-5.svg", 
    "html": "https://zenodo.org/record/3522620", 
    "latest": "https://zenodo.org/api/records/3522620"
  }, 
  "created": "2019-10-30T08:50:49.230873+00:00", 
  "updated": "2020-01-20T16:23:49.966548+00:00", 
  "conceptrecid": "3522619", 
  "revision": 5, 
  "id": 3522620, 
  "metadata": {
    "access_right_category": "success", 
    "doi": "10.26493/978-961-7055-82-5", 
    "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>", 
    "alternate_identifiers": [
      {
        "scheme": "isbn", 
        "identifier": "978-961-7055-82-5"
      }
    ], 
    "title": "A two-stage heuristic for the university course timetabling problem", 
    "license": {
      "id": "CC-BY-4.0"
    }, 
    "notes": "Pages 27-30", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "3522619"
          }, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "3522620"
          }
        }
      ]
    }, 
    "communities": [
      {
        "id": "innorenew"
      }
    ], 
    "grants": [
      {
        "code": "739574", 
        "links": {
          "self": "https://zenodo.org/api/grants/10.13039/501100000780::739574"
        }, 
        "title": "Renewable materials and healthy environments research and innovation centre of excellence", 
        "acronym": "InnoRenew CoE", 
        "program": "H2020", 
        "funder": {
          "doi": "10.13039/501100000780", 
          "acronyms": [], 
          "name": "European Commission", 
          "links": {
            "self": "https://zenodo.org/api/funders/10.13039/501100000780"
          }
        }
      }
    ], 
    "keywords": [
      "University course timetabling", 
      "Local search", 
      "Heuristic"
    ], 
    "publication_date": "2019-10-10", 
    "creators": [
      {
        "affiliation": "University of Szeged, Institute of Informatics", 
        "name": "M\u00e1t\u00e9 Pint\u00e9r"
      }, 
      {
        "affiliation": "InnoRenew CoE; University of Primorska", 
        "name": "Bal\u00e1zs D\u00e1vid"
      }
    ], 
    "access_right": "open", 
    "resource_type": {
      "subtype": "conferencepaper", 
      "type": "publication", 
      "title": "Conference paper"
    }
  }
}
53
48
views
downloads
Views 53
Downloads 48
Data volume 18.1 MB
Unique views 52
Unique downloads 47

Share

Cite as