| Summary: | 碩士 === 中華大學 === 資訊工程學系碩士班 === 103 === Timetabling problems are essential and routine tasks in the beginning of the semester for every school. However, timetabling problems are very complicated and time-consuming for the faculty who is responsible for this task, not only because timetabling problems involves the following five factors: teachers, students, courses, classrooms and time slot, but also because timetabling problems are an NP-Complete problems.
Timetabling problems has been investigated for many decades, and many approaches considering different factors has been proposed. However, since education goals, education policies, and the environment of school changes over time, the objectives and the restrictions of timetabling problems are also changed. As a result, conventional approaches should be further re-investigated because these approaches may no longer suitable for the schools in the current education environment.
In this study, an evolution strategy with meta-heuristics are proposed to solve the current junior high school timetabling problems. The proposed evolution strategy evolves and improves timetable with a number of heuristics. The proposed heuristics repair different violations in timetables during the evolution of our evolution strategy. The experimental results indicated that the proposed meta-heuristic evolution strategy is capable of generating a workable timetable with a small number of soft violations for junior high schools.
|
|---|
