The Study On University Timetabling System Based On Simulated Annealing Algorithm

Course Scheduling Problem, also known as the course schedule, is a having constraint,multi-objective combinatorial optimization problems, timetable should not only feasible,but also to meet the needs of all relevant personnel such as teachers and students, coursetimetabling problem belongs to the humanities category problems related to many factors,each school size, teaching policies and constraints of different course timetabling problemhas been proved to be an NP-complete problem. Under normal circumstances, the coursetimetabling problem can’t obtain enough constraints and therefore were unable to find theoptimal solution with increasing time periods and courses Timetable combinationsincreased sharply, and is likely to produce a combinatorial explosion, because whileoptimal solution search process often requires a lot of time, intolerable, and cause thesystem can’t be used. Simulated annealing with its theory of perfect, local searchoptimization capability is strong and fast computation time and more and more used in thecourse timetabling problem. Timetable program in this article to give up looking for thebest, according to the existing constraints, while in the case of existing resources to meetall the hard constraints to satisfy the soft constraints and produce viable curriculum, andcontinue to optimize and reduce the fitness function values obtained near-optimal solution,so the solution efficiency, flexible algorithm, able to meet the system availability andefficiency requirements. Simulated annealing algorithm is applied to Course SchedulingProblem solving in this paper the following aspects:1. Timetable elements, solving the goal to make a systematic and comprehensive analysis,and careful analysis of the constraints involved by the Course Scheduling Problem Basedon the actual role played by the constraint conditions in the Arrangement Algorithm, can bedivided into seven categories, and elaborated attributed to the hard constraints or softconstraints.2. According to the analysis of the course timetabling problem, the mathematicaldescription of the course timetabling problem, a unified definition of the symbols, andsome constraints, for example, given its formal description, course timetabling problemand the eventual establishment of combinatorial optimization model.3. Iterative local search algorithm to make up for the simulated annealing algorithm is easyto fall into local optimum shortcomings will be improved simulated annealing algorithmapplied to the course timetabling problem. First graph coloring method to generate theinitial feasible solution, and then to apply the simulated annealing algorithm, simulated annealing alternating the use of standard neighborhood and double Kempe chainneighborhood, describes each parameter set and its solution.4. Vocational colleges Timetable for example, object-oriented thinking to complete theoverall design and detailed design of the Course Scheduling System, and Windows7andQT integrated development environment using C language to complete the CourseScheduling System Development, Arrangement Algorithm applied to practice.5. Base on the experiment, analysis on timetable, the continuous improvement of thealgorithm and adjust the system parameters, to reach a better Timetable effect.