Heuristic algorithm for a personalised student timetable

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F18%3A50014538" target="_blank" >RIV/62690094:18450/18:50014538 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-98446-9_8" target="_blank" >http://dx.doi.org/10.1007/978-3-319-98446-9_8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-98446-9_8" target="_blank" >10.1007/978-3-319-98446-9_8</a>

Result language
angličtina
Original language name
Heuristic algorithm for a personalised student timetable
Original language description
This paper present the heuristic algorithm that facilitates very efficient creation of personalised timetables for university students. The goal of the algorithm is to find a timetable with the minimal number of event overlaps and at the same time optimizing the length of the stay of the student at university every week. This goal has been achieved by the modular design of the algorithm that gradually constructs the timetable together with pruning the space of remaining options. The results delivered by this algorithm were compared with the results obtained by exhaustive search and it was concluded that our algorithm is able to find the optimal or a very near optimal solution very quickly. Therefore, the algorithm described here can be utilized for the development of the mobile application.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)