| dc.creator |
Colak, Recep |
|
| dc.creator |
YİĞİT, Tuncay |
|
| dc.date |
2016-12-31T21:00:00Z |
|
| dc.date.accessioned |
2020-10-06T10:32:52Z |
|
| dc.date.available |
2020-10-06T10:32:52Z |
|
| dc.identifier |
77bdabfe-6e3c-477c-a7c4-6ef0e8151e24 |
|
| dc.identifier |
10.1109/ubmk.2017.8093488 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/77bdabfe-6e3c-477c-a7c4-6ef0e8151e24/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/63856 |
|
| dc.description |
Course timetabiling is a process that must be done at the beginning of the education period in all educational institutions. The purpose of the timetabling is to bring together classrooms, lectures, students and lecturers at the same time without any conflicts. Course timetabiling is a difficult problem to solve when classroom constraints, teaching staff preferences, course restrictions are taken into consideration. With a deterministic approach, it can take a lot of time to try all the possibilities and reach a definite solution, and in cases where there are a lot of constraints, no definite solution can be found. In this study, the solving effect of the genetic algorithm parameters, which is an heuristic approach used in the course timetabiling problem, is investigated. Tests were performed for different iteration of different population size with different crossover and mutation rates. As a result of the experiments, it has been observed that the election operator who decides on the new generation will be effective. The selection operator can be set up as a function that depends on the number of individuals, so that better results can be obtained. |
|
| dc.language |
tur |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
The effect of Genetic Algorithm Parameters in the Solution of the Course Timetable Problem |
|
| dc.type |
info:eu-repo/semantics/conferenceObject |
|