The Study Of College Course Dispatching System Based On Genetic Algorithm

Timetabling Problem is a Multi-objective Combination Optimization Problem with constraints, and also has been proved as NP-Completed problem. Genetic Algorithm is a high-effective Paralleling Processing, randomly searching and self-applicable algorithm based on the development of the nature evolution and option, it is a very effective algorithm to resolve NP-Completed Combination Optimization Problem. Genetic Algorithm is applied to solve timetabling problem, combined with the actual timetabling problem on college situation, and is conducted in-depth research and analysis. For the Study of timetabling problem chromo encoding and population initialization, we proposed priority-based greedy algorithm, and introduce the concept of the right. The main task of this thesis includes:1. A detail discussion of the influential factors and main restraining conditions in timetable problem.An analysis of resolution difficulties and objects in timetable problem.A description of timetable problem with mathematical model and an overall plan and technical line for the resolution of timetable problems.2. Aiming at timetable problems, designing the gene coding scheme, and chromosome structure, and made a combined population of greedy algorithm which is initialized. Experiment shows that the improved genetic algorithm is superior to the traditional genetic algorithm.3. With JSP as the foreground development tool and SQL Server 2000 as the background database, designing and implementing the automatic timetable system based on Genetic Algorithm.In this paper, genetic algorithm developed a complete set of Automated Course Scheduling System, the system is now used in colleges and universities graduate school。Teachers and students reflect well. It can be seen from the experimental results that the going after objective value indicatesthat the algorithm is stable and optimal, so the solution is satisfied.