Informed Simulated Annealing for Optimizing Dorm Room Assignments

Assigning dorm rooms to 2500 students with complex and interdependent preferences is a difficult optimization problem. In this paper, we present an optimization method for the whole dorm room assignment problem. The novelty of our method is that we apply an improved variant of simulated annealing, called informed simulated annealing (ISA) proposed by Y. Li. We perform experiments of the ISA algorithm on real data sets. The results obtained from the experiments show that the ISA algorithm is more suitable for the dorm room assignment problem.