Applying Genetic Algorithms on the Course Arrangement in the Elementary School

碩士 === 國立屏東科技大學 === 資訊管理系所 === 99 ===   Before the semester starts, course arrangement has always been one of the most important and complicated issues of general executive affairs which should be taken into consideration of achieving teachers and students’ need and satisfying the limitation of curr...

Full description

Bibliographic Details
Main Authors: Zhao-Wei QIU, 邱炤幃
Other Authors: Deng-Neng Chen
Format: Others
Language:zh-TW
Published: 2011
Online Access:http://ndltd.ncl.edu.tw/handle/85462463981671659712
Description
Summary:碩士 === 國立屏東科技大學 === 資訊管理系所 === 99 ===   Before the semester starts, course arrangement has always been one of the most important and complicated issues of general executive affairs which should be taken into consideration of achieving teachers and students’ need and satisfying the limitation of curriculum and space as well. It’s always a confusing problem to arrange certain school timetable which meets all the constraints above. However, it had been proved that the course arrangement was a NP-Complete problem which didn’t possess a perfect solution. Therefore, most of the course arrangement has been done by human labor which was really time-consuming. The main purpose of this study is to apply Genetic Algorithms into course arrangement. The final goal is to arrange the most acceptable school timetable automatically according to the hard and soft constraints with the self-evolving of Genetic Algorithms. In this study, a Web-based system has been taken for user-friendliness, and we compare the course arrangements of three different elementary schools to actually verify the effectiveness of this system.