Zur Seitenansicht
 

Titelaufnahme

Titel
Modeling high school timetabling with bitvectors
VerfasserDemirovic, Emir ; Musliu, Nysret In der Gemeinsamen Normdatei der DNB nachschlagen
Erschienen in
Annals of Operations Research, 2016,, S. 1-24
Erschienen2016
Ausgabe
Published version
SpracheEnglisch
DokumenttypAufsatz in einer Zeitschrift
Schlagwörter (EN)SMT / High school timetabling / Modeling / Bitvectors / Local search
URNurn:nbn:at:at-ubtuw:3-2878 Persistent Identifier (URN)
DOI10.1007/s10479-016-2220-6 
Zugriffsbeschränkung
 Das Werk ist frei verfügbar
Dateien
Modeling high school timetabling with bitvectors [0.45 mb]
Links
Nachweis
Klassifikation
Zusammenfassung (Englisch)

High school timetabling (HSTT) is a well known and wide spread problem. The problem consists of coordinating resources (e.g. teachers, rooms), times, and events (e.g. lectures) with respect to various constraints. Unfortunately, HSTT is hard to solve and just finding a feasible solution for simple variants of HSTT has been proven to be NP-complete. We propose a new modeling approach for HSTT using bitvectors in which constraint costs of the general HSTT can be calculated using bit operations. This model allows efficient computation of constraint costs making it useful when implementing HSTT algorithms. Additionally, it can be used to solve HSTT with satisfiability modulo theory (SMT) solvers that support bitvectors. We evaluate the performance for our bitvector modeling approach and compare it to the leading engine KHE when developing local search algorithms such as hill climbing and simulated annealing. The experimental results show that our approach is useful for this problem. Furthermore, experimental results using SMT are given on instances from the ITC 2011 benchmark repository.

Notiz
Lizenz
CC-BY-Lizenz (4.0)Creative Commons Namensnennung 4.0 International Lizenz