Iterated VND Versus Hyper-heuristics: Effective and General Approaches to Course Timetabling
Nature-Inspired Design of Hybrid Intelligent Systems, pp. 687-700, 2017.
The course timetabling problem is one of the most difficult combinatorial problems, it requires the assignment of a fixed number of subjects into a number of time slots minimizing the number of student conflicts. This article presents a comparison between state-of-the-art hyper-heuristics and a newly proposed iterated variable neighborhoo...More
Full Text (Upload PDF)
PPT (Upload PPT)