Adaptive randomized descent algorithm using round robin for solving course timetabling problems

This work utilize Round Robin (RR) mechanism to systematically explore neighbors of solution. RR is one of the simplest scheduling algorithms, which assigns time slices to each process in equal portions and in circular order handling all processes without priority. In this work, we consider five different neighborhood structures. RR gives each neighborhood a certain number of iterations to explore some neighbors of the current solution. Experimental results shows that, our adaptive randomized descent algorithm using round robin algorithm significantly produces good-quality solutions (regarding Socha benchmark datasets), which outperformed the ARDA approach and other single-based meta-heuristics.