prikaz prve stranice dokumenta Rješavanje problema rasporeda pomoću meta-heuristika
  Download
PDF 440.8 KB
master's thesis
Rješavanje problema rasporeda pomoću meta-heuristika
Zagreb: University of Zagreb, Faculty of Science, 2021. urn:nbn:hr:217:014995
Deduš, Vedran
University of Zagreb
Faculty of Science
Department of Mathematics

Institutional repository: Repository of the Faculty of Science

Cite this document

Deduš, V. (2021). Rješavanje problema rasporeda pomoću meta-heuristika (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:014995

Deduš, Vedran. "Rješavanje problema rasporeda pomoću meta-heuristika." Master's thesis, University of Zagreb, Faculty of Science, 2021. https://urn.nsk.hr/urn:nbn:hr:217:014995

Deduš, Vedran. "Rješavanje problema rasporeda pomoću meta-heuristika." Master's thesis, University of Zagreb, Faculty of Science, 2021. https://urn.nsk.hr/urn:nbn:hr:217:014995

Deduš, V. (2021). 'Rješavanje problema rasporeda pomoću meta-heuristika', Master's thesis, University of Zagreb, Faculty of Science, accessed 22 November 2024, https://urn.nsk.hr/urn:nbn:hr:217:014995

Deduš V. Rješavanje problema rasporeda pomoću meta-heuristika [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2021 [cited 2024 November 22] Available at: https://urn.nsk.hr/urn:nbn:hr:217:014995

V. Deduš, "Rješavanje problema rasporeda pomoću meta-heuristika", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2021. Available at: https://urn.nsk.hr/urn:nbn:hr:217:014995

Metadata
TitleRješavanje problema rasporeda pomoću meta-heuristika
Title (english)Solving scheduling problems using meta-heuristics
AuthorVedran Deduš
MentorGoranka Nogo (mentor)
Committee memberGoranka Nogo (predsjednik povjerenstva)
Committee memberRobert Manger (član povjerenstva)
Committee memberDijana Ilišević (član povjerenstva)
Committee memberNikola Sandrić (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Science
(Department of Mathematics)
Zagreb
Defense date and country2021-03-04, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
U ovom radu je predstavljen problem rasporeda sati za fakultete. Instanca problema koju promatramo je NP-teška, pa za njegovo rješavanje koristimo meta-heuristiku genetski algoritam. U radu je opisana svaka faza algoritma - od generiranja početne populacije do implementacije križanja i mutacija. Istaknute su prednosti i mane svake faze algoritma. Rezultati su uspoređeni s rezultatima iz radova koji koriste istu instancu problema te su navedeni mogući načini poboljšanja algoritma.
Abstract (english)
In this thesis we present university course timetable problem and one way of solving it. The instance of the problem we are observing is NP-hard, so we use the meta-heuristic genetic algorithm to solve it. All phases of the algorithm, starting from generating initial population to crossover and mutations, are described with their advantages and disadvantages. Results are then compared with others in similar papers. Finally, possible algorithm improvements are described as well.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:217:014995
Study programmeTitle: Computer Science and Mathematics
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra računarstva i matematike (magistar/magistra računarstva i matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2021-03-24 12:10:27