Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Exact and metaheuristic methods for a real-world examination timetabling problem
RISE Research Institutes of Sweden, Digital Systems, Data Science.ORCID iD: 0000-0003-3079-8095
RISE Research Institutes of Sweden, Digital Systems, Data Science. University of Udine, Italy.
University of Udine, Italy.
DTU Technical University of Denmark, Denmark.
Show others and affiliations
2023 (English)In: Journal of Scheduling, ISSN 1094-6136, E-ISSN 1099-1425Article in journal (Refereed) Epub ahead of print
Abstract [en]

We propose a portfolio of exact and metaheuristic methods for the rich examination timetabling problem introduced by Battistutta et al. (in: Hebrard, Musliu (eds) 17th International conference on the integration of constraint programming, artificial intelligence, and operations research (CPAIOR-2020), LNCS, vol 12296. Springer, Berlin, pp 69–81, 2020). The problem includes several real-world features that arise in Italian universities, such as examinations split into two parts, possible requirements of multiple rooms for a single examination, and unavailabilities and preferences for periods and rooms. We developed a CP model encoded in the MiniZinc modeling language and solved it with Gecode, as well as two MIP models solved with Gurobi. The first MIP model is encoded natively and the second one again in MiniZinc. Finally, we extended the metaheuristic method based on simulated annealing of Battistutta et al. by introducing a new neighborhood relation. We compare the different techniques on the real-world instances provided by Battistutta et al., which have been slightly refined by correcting some semantic issues. Finally, we developed a solution checker that is publicly available, together with all instances and solutions, for inspection and future comparisons.

Place, publisher, year, edition, pages
2023.
Keywords [en]
Examination timetabling · Constraint programming · Integer programming · Simulated annealing
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:ri:diva-64418DOI: 10.1007/s10951-023-00778-6OAI: oai:DiVA.org:ri-64418DiVA, id: diva2:1754934
Available from: 2023-05-05 Created: 2023-05-05 Last updated: 2023-06-09Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full texthttps://doi.org/10.1007/s10951-023-00778-6

Authority records

Carlsson, Mats

Search in DiVA

By author/editor
Carlsson, Mats
By organisation
Data Science
In the same journal
Journal of Scheduling
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 33 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf