Variable Neighborhood Search for a Real-World Curriculum-Based University Timetabling Problem

This paper presents the application of Variable Neighborhood Search algorithm and seven of its variants on a real-world highly constrained curriculum-based university course timetabling problem. Experimental results on 14 instances taken from practice are shown and some conclusions about the efficiency of these algorithms on the considered problem are drawn.