Adaptive randomized descent algorithm using Round Robin for solving course timetabling problems

Anmar Abuhamdah, Masri Ayob

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10
Pages1201-1206
Number of pages6
DOIs
Publication statusPublished - 2010
Event2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10 - Cairo
Duration: 29 Nov 20101 Dec 2010

Other

Other2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10
CityCairo
Period29/11/101/12/10

Fingerprint

Scheduling algorithms

Keywords

  • Course timetabling problems
  • Neighborhood selection
  • Round Robin

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Hardware and Architecture

Cite this

Abuhamdah, A., & Ayob, M. (2010). Adaptive randomized descent algorithm using Round Robin for solving course timetabling problems. In Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10 (pp. 1201-1206). [5687021] https://doi.org/10.1109/ISDA.2010.5687021

Adaptive randomized descent algorithm using Round Robin for solving course timetabling problems. / Abuhamdah, Anmar; Ayob, Masri.

Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10. 2010. p. 1201-1206 5687021.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abuhamdah, A & Ayob, M 2010, Adaptive randomized descent algorithm using Round Robin for solving course timetabling problems. in Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10., 5687021, pp. 1201-1206, 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10, Cairo, 29/11/10. https://doi.org/10.1109/ISDA.2010.5687021
Abuhamdah A, Ayob M. Adaptive randomized descent algorithm using Round Robin for solving course timetabling problems. In Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10. 2010. p. 1201-1206. 5687021 https://doi.org/10.1109/ISDA.2010.5687021
Abuhamdah, Anmar ; Ayob, Masri. / Adaptive randomized descent algorithm using Round Robin for solving course timetabling problems. Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10. 2010. pp. 1201-1206
@inproceedings{d052abeb84014c9ba0720e1600d2a25f,
title = "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 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.",
keywords = "Course timetabling problems, Neighborhood selection, Round Robin",
author = "Anmar Abuhamdah and Masri Ayob",
year = "2010",
doi = "10.1109/ISDA.2010.5687021",
language = "English",
isbn = "9781424481354",
pages = "1201--1206",
booktitle = "Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10",

}

TY - GEN

T1 - Adaptive randomized descent algorithm using Round Robin for solving course timetabling problems

AU - Abuhamdah, Anmar

AU - Ayob, Masri

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Course timetabling problems

KW - Neighborhood selection

KW - Round Robin

UR - http://www.scopus.com/inward/record.url?scp=79851484849&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79851484849&partnerID=8YFLogxK

U2 - 10.1109/ISDA.2010.5687021

DO - 10.1109/ISDA.2010.5687021

M3 - Conference contribution

AN - SCOPUS:79851484849

SN - 9781424481354

SP - 1201

EP - 1206

BT - Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10

ER -