Controlling multi algorithms using Round Robin for university course timetabling problem

Khalid Shaker, Salwani Abdullah

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

8 Citations (Scopus)

Abstract

The university course timetabling problem (CTTP) involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraint. The objective is to satisfy the hard constraints (essential requirements) and minimise the violation of soft constraints (desirable requirements). In this study, we apply three algorithms to the CTTP problem: Great Deluge, Simulated Annealing and Hill Climbing. We use a Round Robin Scheduling Algorithm (RR) as a strategy to control the application of these three algorithms. The performance of our approach is tested over eleven benchmark datasets: one large, five medium and five small problems. Competitive results have been obtained when compared with other state-of-the-art techniques.

Original languageEnglish
Title of host publicationCommunications in Computer and Information Science
Pages47-55
Number of pages9
Volume118 CCIS
DOIs
Publication statusPublished - 2010
Event2010 International Conferences on Database Theory and Application, DTA 2010 and Bio-Science and Bio-Technology, BSBT 2010, Held as Part of the 2nd International Mega-Conference on Future Generation Information Technology, FGIT 2010 - Jeju Island
Duration: 13 Dec 201015 Dec 2010

Publication series

NameCommunications in Computer and Information Science
Volume118 CCIS
ISSN (Print)18650929

Other

Other2010 International Conferences on Database Theory and Application, DTA 2010 and Bio-Science and Bio-Technology, BSBT 2010, Held as Part of the 2nd International Mega-Conference on Future Generation Information Technology, FGIT 2010
CityJeju Island
Period13/12/1015/12/10

Fingerprint

Scheduling algorithms
Simulated annealing
Local search (optimization)

Keywords

  • Great Deluge
  • Hill Climbing
  • Round Robin
  • Simulated Annealing
  • Timetabling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Shaker, K., & Abdullah, S. (2010). Controlling multi algorithms using Round Robin for university course timetabling problem. In Communications in Computer and Information Science (Vol. 118 CCIS, pp. 47-55). (Communications in Computer and Information Science; Vol. 118 CCIS). https://doi.org/10.1007/978-3-642-17622-7_6

Controlling multi algorithms using Round Robin for university course timetabling problem. / Shaker, Khalid; Abdullah, Salwani.

Communications in Computer and Information Science. Vol. 118 CCIS 2010. p. 47-55 (Communications in Computer and Information Science; Vol. 118 CCIS).

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

Shaker, K & Abdullah, S 2010, Controlling multi algorithms using Round Robin for university course timetabling problem. in Communications in Computer and Information Science. vol. 118 CCIS, Communications in Computer and Information Science, vol. 118 CCIS, pp. 47-55, 2010 International Conferences on Database Theory and Application, DTA 2010 and Bio-Science and Bio-Technology, BSBT 2010, Held as Part of the 2nd International Mega-Conference on Future Generation Information Technology, FGIT 2010, Jeju Island, 13/12/10. https://doi.org/10.1007/978-3-642-17622-7_6
Shaker K, Abdullah S. Controlling multi algorithms using Round Robin for university course timetabling problem. In Communications in Computer and Information Science. Vol. 118 CCIS. 2010. p. 47-55. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-17622-7_6
Shaker, Khalid ; Abdullah, Salwani. / Controlling multi algorithms using Round Robin for university course timetabling problem. Communications in Computer and Information Science. Vol. 118 CCIS 2010. pp. 47-55 (Communications in Computer and Information Science).
@inproceedings{829c50260eb54e4c838357c0cbba210d,
title = "Controlling multi algorithms using Round Robin for university course timetabling problem",
abstract = "The university course timetabling problem (CTTP) involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraint. The objective is to satisfy the hard constraints (essential requirements) and minimise the violation of soft constraints (desirable requirements). In this study, we apply three algorithms to the CTTP problem: Great Deluge, Simulated Annealing and Hill Climbing. We use a Round Robin Scheduling Algorithm (RR) as a strategy to control the application of these three algorithms. The performance of our approach is tested over eleven benchmark datasets: one large, five medium and five small problems. Competitive results have been obtained when compared with other state-of-the-art techniques.",
keywords = "Great Deluge, Hill Climbing, Round Robin, Simulated Annealing, Timetabling",
author = "Khalid Shaker and Salwani Abdullah",
year = "2010",
doi = "10.1007/978-3-642-17622-7_6",
language = "English",
isbn = "3642176216",
volume = "118 CCIS",
series = "Communications in Computer and Information Science",
pages = "47--55",
booktitle = "Communications in Computer and Information Science",

}

TY - GEN

T1 - Controlling multi algorithms using Round Robin for university course timetabling problem

AU - Shaker, Khalid

AU - Abdullah, Salwani

PY - 2010

Y1 - 2010

N2 - The university course timetabling problem (CTTP) involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraint. The objective is to satisfy the hard constraints (essential requirements) and minimise the violation of soft constraints (desirable requirements). In this study, we apply three algorithms to the CTTP problem: Great Deluge, Simulated Annealing and Hill Climbing. We use a Round Robin Scheduling Algorithm (RR) as a strategy to control the application of these three algorithms. The performance of our approach is tested over eleven benchmark datasets: one large, five medium and five small problems. Competitive results have been obtained when compared with other state-of-the-art techniques.

AB - The university course timetabling problem (CTTP) involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraint. The objective is to satisfy the hard constraints (essential requirements) and minimise the violation of soft constraints (desirable requirements). In this study, we apply three algorithms to the CTTP problem: Great Deluge, Simulated Annealing and Hill Climbing. We use a Round Robin Scheduling Algorithm (RR) as a strategy to control the application of these three algorithms. The performance of our approach is tested over eleven benchmark datasets: one large, five medium and five small problems. Competitive results have been obtained when compared with other state-of-the-art techniques.

KW - Great Deluge

KW - Hill Climbing

KW - Round Robin

KW - Simulated Annealing

KW - Timetabling

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

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

U2 - 10.1007/978-3-642-17622-7_6

DO - 10.1007/978-3-642-17622-7_6

M3 - Conference contribution

AN - SCOPUS:78650789424

SN - 3642176216

SN - 9783642176210

VL - 118 CCIS

T3 - Communications in Computer and Information Science

SP - 47

EP - 55

BT - Communications in Computer and Information Science

ER -