Title: Modeling high school timetabling with bitvectors
Language: English
Authors: Demirović, Emir 
Musliu, Nysret
Category: Research Article
Issue Date: 2016
Journal: Annals of Operations Research
ISSN: 1572-9338
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.
Keywords: SMT; High school timetabling; Modeling; Bitvectors; Local search
DOI: 10.1007/s10479-016-2220-6
Library ID: AC11361249
URN: urn:nbn:at:at-ubtuw:3-2878
Organisation: E192 - Institut für Informationssysteme 
Publication Type: Article
Appears in Collections:Article

Files in this item:

This item is licensed under a Creative Commons License Creative Commons

Page view(s)

checked on Jun 21, 2022


checked on Jun 21, 2022

Google ScholarTM