Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem

Salwani Abdullah, Khalid Shaker, Barry McCollum, Paul McMullan

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

5 Citations (Scopus)

Abstract

In general, course timetabling refers to assignment processes that assign events (courses) to a given rooms and timeslots subject to a list of hard and soft constraints. It is a challenging task for the educational institutions. In this study we employed a great deluge algorithm with kempe chain neighbourhood structure as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within the great deluge algorithm. The performance of our approach is tested over eleven benchmark datasets (representing one large, five medium and five small problems). Experimental results show that our approach is able to generate competitive results when compared with previous available approaches. Possible extensions upon this simple approach are also discussed.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages70-77
Number of pages8
Volume6401 LNAI
DOIs
Publication statusPublished - 2010
Event5th International Conference on Rough Set and Knowledge Technology, RSKT 2010 - Beijing
Duration: 15 Oct 201017 Oct 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6401 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on Rough Set and Knowledge Technology, RSKT 2010
CityBeijing
Period15/10/1017/10/10

Fingerprint

Timetabling
Soft Constraints
Assign
Assignment
Benchmark
Experimental Results

Keywords

  • Course Timetabling
  • Great Deluge
  • Kempe Chain
  • Round Robin

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Abdullah, S., Shaker, K., McCollum, B., & McMullan, P. (2010). Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6401 LNAI, pp. 70-77). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6401 LNAI). https://doi.org/10.1007/978-3-642-16248-0_15

Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem. / Abdullah, Salwani; Shaker, Khalid; McCollum, Barry; McMullan, Paul.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6401 LNAI 2010. p. 70-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6401 LNAI).

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

Abdullah, S, Shaker, K, McCollum, B & McMullan, P 2010, Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6401 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6401 LNAI, pp. 70-77, 5th International Conference on Rough Set and Knowledge Technology, RSKT 2010, Beijing, 15/10/10. https://doi.org/10.1007/978-3-642-16248-0_15
Abdullah S, Shaker K, McCollum B, McMullan P. Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6401 LNAI. 2010. p. 70-77. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-16248-0_15
Abdullah, Salwani ; Shaker, Khalid ; McCollum, Barry ; McMullan, Paul. / Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6401 LNAI 2010. pp. 70-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0ec143771b854916a7ff52d76ef35eb5,
title = "Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem",
abstract = "In general, course timetabling refers to assignment processes that assign events (courses) to a given rooms and timeslots subject to a list of hard and soft constraints. It is a challenging task for the educational institutions. In this study we employed a great deluge algorithm with kempe chain neighbourhood structure as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within the great deluge algorithm. The performance of our approach is tested over eleven benchmark datasets (representing one large, five medium and five small problems). Experimental results show that our approach is able to generate competitive results when compared with previous available approaches. Possible extensions upon this simple approach are also discussed.",
keywords = "Course Timetabling, Great Deluge, Kempe Chain, Round Robin",
author = "Salwani Abdullah and Khalid Shaker and Barry McCollum and Paul McMullan",
year = "2010",
doi = "10.1007/978-3-642-16248-0_15",
language = "English",
isbn = "3642162479",
volume = "6401 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "70--77",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem

AU - Abdullah, Salwani

AU - Shaker, Khalid

AU - McCollum, Barry

AU - McMullan, Paul

PY - 2010

Y1 - 2010

N2 - In general, course timetabling refers to assignment processes that assign events (courses) to a given rooms and timeslots subject to a list of hard and soft constraints. It is a challenging task for the educational institutions. In this study we employed a great deluge algorithm with kempe chain neighbourhood structure as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within the great deluge algorithm. The performance of our approach is tested over eleven benchmark datasets (representing one large, five medium and five small problems). Experimental results show that our approach is able to generate competitive results when compared with previous available approaches. Possible extensions upon this simple approach are also discussed.

AB - In general, course timetabling refers to assignment processes that assign events (courses) to a given rooms and timeslots subject to a list of hard and soft constraints. It is a challenging task for the educational institutions. In this study we employed a great deluge algorithm with kempe chain neighbourhood structure as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within the great deluge algorithm. The performance of our approach is tested over eleven benchmark datasets (representing one large, five medium and five small problems). Experimental results show that our approach is able to generate competitive results when compared with previous available approaches. Possible extensions upon this simple approach are also discussed.

KW - Course Timetabling

KW - Great Deluge

KW - Kempe Chain

KW - Round Robin

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

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

U2 - 10.1007/978-3-642-16248-0_15

DO - 10.1007/978-3-642-16248-0_15

M3 - Conference contribution

AN - SCOPUS:78349267543

SN - 3642162479

SN - 9783642162473

VL - 6401 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 70

EP - 77

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -