Abstract
Timetabling problem is a kind of combinatorial optimizations. However, it is very difficult to solve this problem with the enormous total number of combination and the complexity of the limitation condition. In this study, we develop the timetabling algorithm for Osaka International University. So, we design the reduced model and propose a solution method by Differential Evolution (DE). Specifically, we propose one of generating method of initial population. This study is a new trial such as to apply the DE to timetabling problem. Furthermore, one of new solution method is also proposed. This method creates a timetable for sophomore and freshman simultaneously. Moreover, it can treat the connection of class, such as both sophomore and freshman can attend a same class. We will report on the announcement day about the results obtained from the new proposed method.
