Laboratory Exercise Scheduling

Genetski algoritmi primjenjivi su na širok spektar problema, a izrada rasporeda sati jedan je od konkretnih i primjenjivih problema. U sklopu ovog rada opisan je rad generacijskog genetskog algoritma s mogućim rješenjima raznih operatora potrebnih za rad algoritma. Uspoređeni su utjecaji različitih konfiguracija i rezultata dobivenih iz provedenih eksperimenata kako bi se ispitala kvaliteta generiranih rasporeda. Usporedbom rezultata odabrana je konfiguracija koja je predložena kao konačno rješenje problema.Genetic algorithms are applicable to a wide range of problems, and class scheduling is one of concrete and applicable problems. As part of this paper, the operation of the generational genetic algorithm is described with the possible solutions of various operators required for the operation of the algorithm. The effects of different configurations and the results obtained from the conducted experiments were compared in order to examine the quality of the generated schedules. By comparing the results, the configuration that was proposed as the final solution to the problem was selected