| Summary: | Exam seat allocation has become a complex problem, with an increasing number of students, subjects, exams, departments, and rooms in higher education institutions. The requirements and constraints of this problem demonstrate characteristics similar to extensively researched exam timetabling problems. They plan for a limited capacity effectively and efficiently. Additionally, exam seating requires a seating arrangement to reduce the number of cheating incidents. In the literature, several genetic algorithm-based methods have been recommended to
prevent students, who are close friends, from sitting close during the exams while providing the best exam session arrangement. We improved the performance of the genetic algorithm using parameter optimization and a new elitism method to increase the saturation rate and accuracy. The algorithm was tested on a real-world dataset and demonstrated high potential for the realization of a high-quality seating arrangement compatible with the requirements of educational institutions.
|
|---|