Genetic Algorithm-based University Curriculum Problem Solving Method

Timetabling Problem is a sort of problem that we often confront inour daily lives. It is a part of operation research and it is a typicalcombinational optimization and constraint optimization problem.University Timetabling Problem is a representative problem in this areaand it has been proved to be NP Complete. It is usually difficult to solve it.Because of its momentous meaning in the true life, people have proposedseveral methods to solve it.This paper analyzes the characteristics of the university timetablingproblem, as well as the advantages and weakness of its various solutionmethods. The author has designed a model which is fit for the fact of thedomestic universities. The model involves general factors, and it is beensolved by the improved self-adaptive, mixed genetic algorithm. It has afavorable effect by testing on some examples.This paper also primarily discusses the application of theObject-Oriented method in the GA programs design, and it has madesome object-oriented analysis and design for the university timetablingproblem. A favorable foundation has been made to construct anapplication for the university timetabling problem.