Solving the exam scheduling problems with Genetic Algorithms
| dc.contributor.author | Mamay K. | |
| dc.date.accessioned | 2024-12-12T08:47:46Z | |
| dc.date.available | 2024-12-12T08:47:46Z | |
| dc.date.issued | 2023 | |
| dc.description.abstract | The exam scheduling problem is a complex task faced by educational institutions worldwide. Efficiently allocating exams within limited time slots while considering various constraints, such as student preferences, room capacities, and faculty availability, poses a significant challenge. This dissertation aims to address the exam scheduling problem by leveraging the power of Genetic Algorithms (GAs). Genetic Algorithms are robust search and optimization techniques inspired by the process of natural selection. By employing evolutionary principles, GAs have proven to be effective in finding optimal or near-optimal solutions for a wide range of combinatorial optimization problems. In this study, Ipresent a new application of genetic algorithms to solve the exam scheduling problem, to devise a solution that can be applied to Kazakhstan universities, and to evaluate the performance of GA compared to other existing algorithms commonly used in this field. | |
| dc.identifier.uri | https://repository.sdu.edu.kz/handle/123456789/1576 | |
| dc.language.iso | en | |
| dc.subject | student preferences, room capacities, faculty, exam scheduling | |
| dc.title | Solving the exam scheduling problems with Genetic Algorithms | |
| dc.type | Other |