图着色算法解决考试时间安排问题的优化

时间表问题是将有限的时间资源分配给多个对象的资源分配问题,它是一类具有多约束条件的组合优化问题。时间表问题已经被证明是一个NP完全问题。大学考试时间安排问题是时间表问题的一个应用,利用改进的图着色算法来处理大学考试的时间安排问题能够最大程度上使考试时间安排得更加人性化、合理化。实验测试表明,基于所给出的算法实现的考试时间安排系统具有良好的可行性、实用性和优越性。

A Graph Coloring Algorithm for Optimization of Course Examination Arrange Problem

Time Table Problem(TTP)mainly discusses how to assign limited resourse to multi objects.TTP has been proved as a NPC problem.The paper introduced a improved Graph Coloring algorithm to solve college examination time table problem which is an application of TTP.The result shows that the alogrithm can assign examination time more humanized and rationally.An examination arrangement system is realized based on the algorithm after the college examination time table problem is thoroughly considered in the paper.The results show that the system is highly practical and superior.