Optimize Analysis And Design Of Exam Exam Management Soft

The concentrative exam arrangement is a key in soft development of exam management soft. The exam arrangement can be seen as a problem of nodal coloring in combination optimization theory. This paper analyzes and optimizes the existing algorithms of nodal coloring problem, then designs a new according the characteristics of exam arrangement in our university. By using the algorithm, the efficiency of exam arrangement has been improved greatly.The problem of nodal coloring belongs to NP-complete problems. The resolution way of NP-complete problems usually has two steps. The first step is to find the initialization resolution by using one-step heuristic algorithm. The second step is to explore the best results by using intelligent algorithm. A new one-step heuristic algorithm to nodal coloring problem is introduced in this paper which can provide a preferable initialization to tabu search algorithm. This paper apply tabu search algorithm with optimizing parameters to the nodal coloring problem and obtain a good results.To increase the efficiency and the resource using in makeup arrangement by manual arrangement, we apply the new one-step heuristic algorithm to makeup arrangement and get better result than the traditional algorithm. And then the tabu search algorithm is used to improve the rationality of exam arrangement and obtain satisfied results.