TAILIEUCHUNG - An enhanced genatic algorithm based courses timetabling method for maximal enrollments using maximum matching on bipartite graphs

Universities usually use academic credit systems for holding all training courses. They have to establish a suitable timetable for enrollment by students at beginning of every semester. This timetable must be met to all hard constraints and it is satisfied to soft constraints as high as possible. In some universities, students can enroll to the established timetable so that among of their courses is as much as possible. This leads to finish their studying program earlier than normally cases. In addition, this also leads to well-utilized resources such as facilities, teachers and so forth in universities. However, a timetable usually has so many courses and some its courses have same subjects but different time-slots. These may cause difficulties for manually enrolling by students. It may be fall into conflict of time when choosing two courses at same time-slots. It is difficult for enrollment with high satisfied. In this paper, we design a genetic algorithm based method for university timetable with maximal enrollments by using maximum matching on bipartite graphs. | An enhanced genatic algorithm based courses timetabling method for maximal enrollments using maximum matching on bipartite graphs

• Giáo dục học
• University timetables
• Genetic algorithm
• Bipartite graph
• Maximum matching
• Maximum matching on bipartite graphs