Memetic algorithm for a university course timetabling problem

Abstract

Evolutionary algorithm is a part of evolution computation. It often induces well approximated solutions to several kinds of hard optimization problems. This paper applies Memetic algorithms - a hybrid evolutionary method to a real-world university timetabling problem in Vietnam. Memetic algorithm and genetic algorithm are both experimentally tested on six real-world instances and obtained results show that memetic algorithm could speed up the convergence much more than genetic algorithm. © 2011 Springer-Verlag.