Course timetabling is an important and recurring administrative activity in most educational institutions. This chapter describes an automated configuration of a generic memetic algorithm to solving this problem. This algorithm shows competitive results on well-known instances compared against top participants of the most recent International ITC2007 Timetabling Competition. Importantly, our study illustrates a case where generic algorithms with increased autonomy and generality achieve competitive performance against human designed problemspecific algorithms.
CITATION STYLE
Jorge, S. A., Martin, C., Hector, P., Patricia, M., Hugo, T. M., Laura, C., & Marco, S. F. (2014). Generic memetic algorithm for course timetabling ITC2007. Studies in Computational Intelligence, 547, 481–492. https://doi.org/10.1007/978-3-319-05170-3_33
Mendeley helps you to discover research relevant for your work.