An application of genetic algorithm methods for teacher assignment problems

摘要

The arrangement of courses at universities is an optimal problem to be discussed under multiple constraints. It can be divided into two parts: teacher assignments and class scheduling. This paper focused primarily on teacher assignments. Consideration was given to teacher's professional knowledge, teacher preferences, fairness of teaching overtime, school resources, and the uniqueness of the school's management. Traditional linear programming methods do not obtain satisfactory results with this complex problem.In this paper, genetic algorithm methods were used to deal with the issue of multiple constraints. As a global optimal searching method, the results of this study indicated that genetic algorithms can save significant time spent on teacher assignments and are more acceptable by the teachers.