| Summary: | 碩士 === 國立臺北教育大學 === 資訊科學系碩士班 === 104 === University-level course scheduling is basically a multiple constraint satisfaction problem. This problem is limited by resource allocation, also belonging to the NP-Complete problem, there are such restrictions on resources as course, teacher, classroom, class, in many research fields, and the results cannot be made absolutely to satisfy solutions when dealing with this problem.
The purpose of this study is to construct a mathematical model develop an automatic school timetabling program using the Artificial Immune Algorithm is as the search structure with the class of artificial immune algorithms optimal solution of the search. In this thesis, the algorithm architecture is implemented by MATLAB® and adopt for the problem of school timetabling in middle-large junior high school.
|
|---|
