Institutional Repository of Vilnius University
Tvarkaraščių sudarymas naudojant grafų spalvinimo algoritmus /
Abstract
dc:descriptionThe purpose of this bachelor’s thesis is to examine the timetable scheduling issue. The main target of this problem is considered to be the correct distribution of provided resources (lecturers, student groups, and lecture halls), as a consequence, it is of great importance that the given list of constraints would be accounted for. Several constraints are used in the developed solution, for instance: lecturers and students can not indulge themselves in, while lecture halls must not hold more than a single activity at any one given time. Additionally, lecture halls must be sizable enough to hold the student groups appointed to them, as well as some other hard and soft constraints, are included. The developed system focuses on solving the university course scheduling problem. To solve the given problem the graph coloring approach, alongside other algorithms was chosen. Not only were the greedy graph coloring approaches (Welsh-Powell, Recursive largest first and Degree of saturation) used, but also a modification of a Tabu search algorithm is examined. Furthermore, the results of these algorithms are analyzed. These, alongside other algorithms, are used to create a weekly schedule for university courses. A functional prototype was created. A graphical user interface in the form of an internet website was chosen as a way to represent the developed prototype and its functionality.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2021
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Petrauskas, Gytis,
- Contributors dc:contributor
-
- Astrauskas, Rokas
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD107118460&prefLang=en_US