In:
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, Duzce Universitesi Bilim ve Teknoloji Dergisi, Vol. 9, No. 6 ( 2021-12-31), p. 150-166
Abstract:
The course scheduling problem that universities do at the beginning of each semester is one of the combinatorial optimization problems. Scheduling problems are NP-Hard problems and difficult to solve. Although it is possible to solve with algorithms such as trying all possible possibilities with a deterministic approach, these algorithms are not used in practice because it is a very time-consuming process. Especially when the data of the problem increases and there are too many constraints to be solved, it becomes more difficult to reach a solution. In this study, the lesson scheduling problem is considered as hard and soft constraints that need to be solved. Hard constraints are constraints that need to be resolved, such as course conflict, classroom conflict, assigning a branch to a classroom that is not suitable for capacity. Soft constraints, on the other hand, are constraints that can be neglected by assigning courses to undesirable time slots. In this study, the hard and soft constraints of the problem were determined and the solutions with the least penalty points were sought by assigning penalty points to the situations in which these constraints were violated. Genetic Algorithm, which is frequently used in scheduling problems, was used to solve the problem. As a result of the tests, it was seen that the course scheduling problem could be solved in a short time with the Genetic Algorithm.
Type of Medium:
Online Resource
ISSN:
2148-2446
DOI:
10.29130/dubited.1012132
Language:
Unknown
Publisher:
Duzce Universitesi Bilim ve Teknoloji Dergisi
Publication Date:
2021
Permalink
