Memetic algorithm behavior on timetabling infeasibility

Memetic Algorithm is one of the metaheuristic techniques commonly used to solve timetabling problems due to its explorative as well as exploitative properties to produce feasible timetables. To design a memetic algorithm effectively, we need to characterize its behavior on a range of timetabling problems so that its performance can be fine tuned accordingly. In this work, we present our analysis on the memetic algorithm behavior on university course timetabling problems to produce feasible timetables. Results show the specification of Memetic Algorithm operators affect the range of problem size in which the algorithm behaves properly.