The Design And Implementation Of The Course Scheduling System Based On Improved Backtracking Algorithm

Along with the rapid development and popularization of computer technology,information management is applied to all sectors of society widely, which includes theschool’s course scheduling problems. Course scheduling has been a hot issue for themajority of scholars. However, it is a difficult job. Solving the problem of courseconflict caused by environment has been considered the only way to design the coursesystem. Nowadays course scheduling system shows poor versatility because ofvarious school timetable environments. Therefore, the idea of improved backtrackingalgorithm is put forward and a suitable course scheduling system for the colleges anduniversities is developed by the author through reading and studying literatures oncourse scheduling aspects.Backtracking algorithm is a kind of priority search method. It has a clear andsimple principle and easy to use, and it also has the characteristics that can search outthe possibilities of all solutions of the course scheduling problems. But itsdisadvantage is relatively obvious, if the course scheduling resources that involved istoo complex or too large in scale, the system not only will greatly reduce the coursescheduling efficiency, and the fitness of the scheduled course is also very low, whichcan not meet the need of the college complex course scheduling. To solve thisproblem, a set timetable resources priority and new ideas to improve the search of thesolution space of the improved depth-first method are proposed base on the coursescheduling algorithm research at home and abroad: First, setting the priority ofcurriculum resources, that is, dealing with the strict conditions first in coursearrangement, avoiding more conflicts in middle and later periods of the coursearrangement, causing too much back, this has greatly increased the efficiency ofcurriculum arrangement algorithm. Second, the improved depth-first search solution space, taking advantage of the priority of scheduling resource, according to the actualarrangement, setting up the connection among the various resource priority,identifying the steps to search solution space. At the same time of the coursescheduling algorithm to further improve the efficiency, making the schedule closer tothe actual, similar to manual schedule.As shown in the functional test of the subsequent actual course arrangementsystem, compared with the general arrangement system of backtracking algorithmunder the condition of equal severity, the time of course arrangement system based onimproved backtracking algorithm reduces by9.8%, and the schedule is closer toactual situation. Further improvement of course scheduling algorithm is discussed atthe end of the paper.