Genetic Algorithm for Solving Multi-Objective Optimization in Examination Timetabling Problem
DOI:
https://doi.org/10.3991/ijet.v16i11.21017Keywords:
examination timetabling, multi-objective optimization, combinatory optimization, genetic algorithm, compromise programmingAbstract
Examination timetabling is one of 3 critical timetabling jobs besides enrollment timetabling and teaching assignment. After a semester, scheduling examinations is not always an easy job in education management, especially for many data. The timetabling problem is an optimization and Np-hard problem. In this study, we build a multi-objective optimizer to create exam schedules for more than 2500 students. Our model aims to optimize the material costs while ensuring the dignity of the exam and students' convenience while considering the rooms' design, the time requirement of each exam, which involves rules and policy constraints. We propose a programmatic compromise to approach the maximum tar-get optimization model and solve it using the Genetic Algorithm. The results show the effectiveness of the introduced algorithm.
Downloads
Published
2021-06-04
How to Cite
Ngo, S. T., Jaafar, J. B., Aziz, I. A., Nguyen, G. H., & Bui, A. N. (2021). Genetic Algorithm for Solving Multi-Objective Optimization in Examination Timetabling Problem. International Journal of Emerging Technologies in Learning (iJET), 16(11), pp. 4–24. https://doi.org/10.3991/ijet.v16i11.21017
Issue
Section
Papers