.png){kind=icon}
Return
An application of genetic algorithm methods for teacher assignment problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0957-4174(02)00017-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2002 Elsevier Science Ltd. All rights reserved.
Keywords:
genetic algorithms
teaching assignment
optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
No organization information available
Cited Papers
No cited papers available