Great Deluge with Non-linear Decay Rate for Solving Course Timetabling Problems

Abstract—Course timetabling is the process of al-locating, subject to constraints, limited rooms and timeslots for a set of courses to take place. Usu-ally, in addition to constructing a feasible timetable (all constraints satisfied), there are desirable goals like minimising the number of undesirable alloca-tions (e.g. courses timetabled in the last timeslot of the day). The construction of course timetables is regarded as a complex problem common to a wide range of educational institutions. The great deluge algorithm explores neighbouring solutions which are accepted if they are better than the best solution so far or if the detriment in quality is no larger than the current water level. In the original great deluge, the water level decreases steadily in a linear fashion. In this paper, we propose a modi-fied version of the great deluge algorithm in which the decay rate of the water level is non-linear. The proposed method produces new best results in 4 of the 11 course timetabling problem instances used in our experiments. Index Terms—course timetabling, great deluge al-gorithm, local search, meta-heuristics. I