Heuristic algorithm for a personalised student timetable

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Heuristic algorithm for a personalised student timetable

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Heuristic algorithm for a personalised student timetable

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název statě ve sborníku

Lecture notes in computer science

ISBN

978-3-319-98445-2

ISSN

0302-9743

e-ISSN

neuvedeno

Počet stran výsledku

10

Strana od-do

79-88

Název nakladatele

Springer

Místo vydání

Berlin

Místo konání akce

Bristol

Datum konání akce

5. 9. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—