Automated Course Arrangement Based on Simulated Annealing Technique

This paper discusses the problem of senior high school course arrangement. The difficulty of the problem mainly lies in how to solve lots of conflicts existing in the schedule and how to optimize it. This paper focuses on the issue that local search algorithm is prone to fall into the local optimum and does not adapt to the course arrangement under multiple constraints. A simulated annealing algorithm is introduced for automated course arrangement. As the course arrangement problem is a NP-complete problem, the proposed algorithm has capability of searching the optimal solution within defined space in theory.