Applying genetic algorithm to university classroom arrangement problem

Abstract

Abstract University classroom arrangement problem is considered as a sub-question of the university timetabling problem, which has been proved to be an NP-hard problem in combinatorial optimization field. In this paper, we firstly analyzed the relevant factors and set up a model of the problem. Then the genetic algorithm was applied to optimize the arrangement of classroom considering the moving distance of students between courses, which was caused by room changing. The experimental results have shown that the genetic algorithm could generate feasible solutions and optimize the classroom arrangement.