Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables

Salwani Abdullah, Khalid Shaker, Hothefa Shaker

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three algorithms, that is, Great Deluge, Simulated Annealing and Hill Climbing where the Round Robin algorithm is used as control strategy in choosing the algorithm to be employed at the current stage. The performance of the approach is tested with over two sets of benchmark datasets, that is, enrolment-based course timetabling and curriculum-based course timetabling (UD1) in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed approach is able to produce competitive results for the test UCTPs.

Original languageEnglish
Pages (from-to)1452-1462
Number of pages11
JournalInternational Journal of Physical Sciences
Volume6
Issue number6
Publication statusPublished - Mar 2011

Fingerprint

requirements
simulated annealing
Simulated annealing
Curricula
Local search (optimization)

Keywords

  • Great deluge
  • Hill climbing algorithm
  • Round robin
  • Simulated annealing
  • University course timetabling problem

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Electronic, Optical and Magnetic Materials

Cite this

Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables. / Abdullah, Salwani; Shaker, Khalid; Shaker, Hothefa.

In: International Journal of Physical Sciences, Vol. 6, No. 6, 03.2011, p. 1452-1462.

Research output: Contribution to journalArticle

@article{3f9e8e64492442d992d2e675ae1a0e2d,
title = "Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables",
abstract = "This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three algorithms, that is, Great Deluge, Simulated Annealing and Hill Climbing where the Round Robin algorithm is used as control strategy in choosing the algorithm to be employed at the current stage. The performance of the approach is tested with over two sets of benchmark datasets, that is, enrolment-based course timetabling and curriculum-based course timetabling (UD1) in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed approach is able to produce competitive results for the test UCTPs.",
keywords = "Great deluge, Hill climbing algorithm, Round robin, Simulated annealing, University course timetabling problem",
author = "Salwani Abdullah and Khalid Shaker and Hothefa Shaker",
year = "2011",
month = "3",
language = "English",
volume = "6",
pages = "1452--1462",
journal = "International Journal of Physical Sciences",
issn = "1992-1950",
publisher = "Academic Journals",
number = "6",

}

TY - JOUR

T1 - Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables

AU - Abdullah, Salwani

AU - Shaker, Khalid

AU - Shaker, Hothefa

PY - 2011/3

Y1 - 2011/3

N2 - This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three algorithms, that is, Great Deluge, Simulated Annealing and Hill Climbing where the Round Robin algorithm is used as control strategy in choosing the algorithm to be employed at the current stage. The performance of the approach is tested with over two sets of benchmark datasets, that is, enrolment-based course timetabling and curriculum-based course timetabling (UD1) in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed approach is able to produce competitive results for the test UCTPs.

AB - This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three algorithms, that is, Great Deluge, Simulated Annealing and Hill Climbing where the Round Robin algorithm is used as control strategy in choosing the algorithm to be employed at the current stage. The performance of the approach is tested with over two sets of benchmark datasets, that is, enrolment-based course timetabling and curriculum-based course timetabling (UD1) in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed approach is able to produce competitive results for the test UCTPs.

KW - Great deluge

KW - Hill climbing algorithm

KW - Round robin

KW - Simulated annealing

KW - University course timetabling problem

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

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

M3 - Article

VL - 6

SP - 1452

EP - 1462

JO - International Journal of Physical Sciences

JF - International Journal of Physical Sciences

SN - 1992-1950

IS - 6

ER -