A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
TENCON 2011 - 2011 IEEE Region 10 Conference
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 feasibledoi:10.1109/tencon.2011.6129070 fatcat:esdwvntitrftlahduvjcejyure