论文答辩日程编排算法问题的研究

Study on the Algorithm of the College Thesis Defense System

针对传统排课算法中在处理排课问题时易陷入局部最优解,从而影响求解质量,提出了一种基于矩阵迭加匹配的算法,优化了排课算法的处理流程,并设计实现了一个高效智能论文答辩系统。该系统是解决答辩组、教师、教室、答辩模式四元组与时间的匹配问题。经实际运行表明,矩阵迭加匹配的算法可以明显改善排课问题的求解质量。

The traditional course scheduling algorithms easily fall into local optimal solution and thus affect the solution quality. This paper presents a matching algorithm based on matrix superpgsition, optimizing processing flow of course scheduling algorithm and designs and realizes an efficient course arranging system. The system is to solve the time matching problem of the respondent groups, teachers, classrooms, and the defense mode. The superposition matrix matching algorithm can significantly improve the quality of arranging schedule for solving the problem.