基于禁忌搜索法的排课系统设计与应用

Design and application of course scheduling system based on tabu search method

针对目前国内高校教学排课的复杂性质与现行的大学课表问题模型求解方案的不足,文中分析了有约束的多目标NP完全问题与其各种解决方法,将现代启发式的禁忌搜索算法与传统经典的网络流算法进行结合,提出了一种基于禁忌搜索算法的排课系统设计方案。该问题解决方案将两种算法优势互补,提高了处理问题的能力,并使用此方案设计排课系统。经过实验验证与实际使用情况表明,文中所设计的系统操作性强,搜索速率得到大幅提高,且能够完成目标要求,具有可用性与可适性。

In view of the complex nature of the teaching timetabling at home and the shortage of the model solution of the current university timetable problem,the multi-objective NP complete problem with constraints and its various solutions are analyzed.Combining the modern heuristic tabu search algorithm with the traditional network flow algorithm,a tabu search algorithm based scheduling system is proposed.The problem solution combines the advantages of the two algorithms and improves the ability of problem processing,and the course arrangement system is designed with this design scheme.The experimental verification and practical application show that the system designed by this design is highly operational,the search speed is greatly improved,and the target requirements can be achieved.The system has availability and suitability.