Loading [a11y]/accessibility-menu.js
Adaptive randomized descent algorithm using round robin for solving course timetabling problems | IEEE Conference Publication | IEEE Xplore

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


Abstract:

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 t...Show More

Abstract:

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.
Date of Conference: 29 November 2010 - 01 December 2010
Date Added to IEEE Xplore: 13 January 2011
ISBN Information:

ISSN Information:

Conference Location: Cairo, Egypt

Contact IEEE to Subscribe

References

References is not available for this document.