Poster - Guided Genetic Algorithm to Solve University Course Timetabling with Dynamic Time Slot

UNSPECIFIED Poster - Guided Genetic Algorithm to Solve University Course Timetabling with Dynamic Time Slot. .

[img]
Preview
Text (Sertifikat HKI)
HKI - Poster PDP 2020.pdf - Published Version

Download (773kB) | Preview
[img]
Preview
Text (Dokumen Poster)
Poster PDP - Fachrie Anita.pdf - Supplemental Material

Download (212kB) | Preview

Abstract

This work discussed about one of the most popular technique in Evolutionary Computation, i.e., Genetic Algorithm to solve the UCTP that has dynamic teaching time slot. Duration of a lecture is determined by the course’s credit which means that the structure of course timetable can be different between one day to the others. This kind of timetable structure is more complex since the flexible time slot could produce high number of schedules possibility. Hence, a flexible chromosome is developed to deal with dynamic time slot and enhanced the efficiency of the system by eliminating the crossover process which usually time consumed. A Guided Creep Mutation is proposed to act as an evolutionary operator that guides the chromosomes to find global optimum by changing certain gene value gradually in every generation. Our system successfully generated optimum schedule for 878 and 1140 courses in odd and even semester with zero collision in rooms, time, lecturers, also satisfied all soft constraints given. Based on our experiments, the system needs relatively small number of generations with few chromosomes to generate an optimum schedule.

Item Type: Patent
Depositing User: S.T., M.Cs Muhammad Fachrie
Date Deposited: 22 Jul 2021 16:06
Last Modified: 22 Jul 2021 16:06
URI: http://eprints.uty.ac.id/id/eprint/7749

Actions (login required)

View Item View Item