Abstract

Exam seat allocation becomes a complex problem concerning the increasing number of students, subjects, exams, departments, and rooms in a higher institution. The requirements and constraints of this problem demonstrate similar characteristics to extensively researched exam timetabling problems. They are planning limited capacity effectively and efficiently. Additionally, exam seating requires a seating arrangement to reduce cheating incidents. In the literature, several genetic algorithm-based methods were recommended to prevent students that have a friendship from sitting close during the exams while providing the best exam session arrangement. We have improved the performance of the genetic algorithm by parameter optimization and a new elitism method to increase saturation rate and accuracy. The algorithm has been tested on a real-world data set and represents a high potential for the realization of a high-quality seating arrangement compatible with the real world.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.