The Research Of Genetic Algorithm In TTP

Timetabling Problem (TTP) is a Multi objective Combination Optimization Problem with constraints, and also has been proved NP-Completed; It is the demand researching that complete solved completely for its of both university education management and theory the table scheduling with computers. The purpose of this paper is to try another way to solve the complex problem.Genetic Algorithm (GA) is a high-effective randomly searching algorithm, based on the nature evolution. It is a very effective algorithm to resolve NP-Completed Combination Optimization Problem. The paper is aimed at solving timetabling problem using GA. The main content are as following: 1. We systematically and completely discuss factors, restrictions, objective and difficulty attached to TTP, describes TTP by mathematic model, and bring forward t he whole frame and technology route of methods.