Font Size: a A A

Based On Course Scheduling System For Multi-campus In The Credit System Of The Genetic Algorithm

Posted on:2011-06-23Degree:MasterType:Thesis
Country:ChinaCandidate:X B YangFull Text:PDF
GTID:2208330332976932Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
Course scheduling is one of quite important and complex administration works in the teaching management in colleges and universities. With the development of higher education, the enrolled students in colleges and universities have been unceasingly increased. Under the conditions of limited teaching resources such as classroom resources and teacher resources and so on, course scheduling is more arduous and complicated, which is even becoming one of the key factors in the teaching management that impact developing students and improving the quality of teaching to a certain extent and depth. Although manual course scheduling takes up a lot of manpower and costs too much time, still its results are always less than satisfactory. Thus, how to achieve course scheduling with more accuracy and reasonableness, higher efficiency and satisfaction by using computer is well worth studying.In practical research, because of course arrangement subject to various conditions, it is very difficult to develop a course scheduling system to conform to individual demands. Course scheduling problem is not only a strong-restriction, non-linear, multi-objective optimization NP-complete problem, but also a combinatorial optimization problem which is proved to be NP-hard. A Genetic Algorithm (GA) is a highly parallel, adaptive, random searching algorithm, derived from evolutionism based on natural selection and genetic mechanism, which is a very effective algorithm to resolve NP-Complete combination optimization problem, especially complicated non-linear issues that are difficult to solve with traditional search methods, by using grouping search technology.In a few years of work in the Office of Academic Affairs, Kunming University of Science and Technology, I have been responsible for course arrangement and realized the complexity of course scheduling that is always too difficult to be completed in a short time to satisfy all the teachers and students. Therefore, in view of difficulty and complexity in course scheduling, an algorithm suitable for our university's system is designed to maximally improve the efficiency and accuracy of course scheduling, based on the requirements on informatization of academic affairs by Kunming University of Science and Technology and the features of multiple campuses, large scale, relative shortage of various teaching resources in our university.In this dissertation, a preliminary study is made about genetic algorithms. Aimed at course arrangement for several university campuses, according to the relevant genetic algorithm and multi-objective optimization theory, a genetic-algorithm-based algorithm for course scheduling is presented, by which some key factors can be determined according to the three kinds of constraints for course scheduling----rigid constraints, neutral constraints and soft constraints, and resolutions are given for the conflicts occurring in the process of course arrangement. By using this randomly generated university timetable planning and optimization algorithm, the actual course arrangement can be greatly reflected and multiple targets can be tried to achieve and optimize. As a result, a course scheduling system can be obtained to meet the needs of our university actual situations.
Keywords/Search Tags:Genetic Algorithm, Course Scheduling, NP Complete Problem, Constraints
PDF Full Text Request
Related items