Incorporating great deluge approach with kempe chain neighbourhood structure for curriculum-based course timetabling problems

Khalid Shaker, Salwani Abdullah

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

10 Citations (Scopus)

Abstract

Constructing university course timetable is a very difficult task where a set of events has to be scheduled in timeslots and located in suitable rooms. The objective of course timetabling problem is to satisfy the hard constraints and minimize the violation of soft constraints. In this paper, a hybridization of great deluge algorithm with kempe chain neighbourhood structure is employed. The problem is solved in two steps: a graph-based heuristic is used to construct a feasible timetable in the first step, and the improvement is carried out by employing a hybrid approach in the second step. The approach is tested on the curriculum-based course timetabling problems as described in the 2nd International Timetabling Competition (ITC2007). We present the result of our technique in relation to the competition results that show the proposed approach is able to produce promising results for the university course timetabling problem.

Original languageEnglish
Title of host publication2009 2nd Conference on Data Mining and Optimization, DMO 2009
Pages149-153
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 2nd Conference on Data Mining and Optimization, DMO 2009 - Bangi, Selangor
Duration: 27 Oct 200928 Oct 2009

Other

Other2009 2nd Conference on Data Mining and Optimization, DMO 2009
CityBangi, Selangor
Period27/10/0928/10/09

Fingerprint

Curricula

Keywords

  • Course timetabling
  • Great Deluge
  • Hybrid heuristic
  • Kempe chain

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Incorporating great deluge approach with kempe chain neighbourhood structure for curriculum-based course timetabling problems. / Shaker, Khalid; Abdullah, Salwani.

2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 149-153 5341894.

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

Shaker, K & Abdullah, S 2009, Incorporating great deluge approach with kempe chain neighbourhood structure for curriculum-based course timetabling problems. in 2009 2nd Conference on Data Mining and Optimization, DMO 2009., 5341894, pp. 149-153, 2009 2nd Conference on Data Mining and Optimization, DMO 2009, Bangi, Selangor, 27/10/09. https://doi.org/10.1109/DMO.2009.5341894
Shaker, Khalid ; Abdullah, Salwani. / Incorporating great deluge approach with kempe chain neighbourhood structure for curriculum-based course timetabling problems. 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. pp. 149-153
@inproceedings{862ee1a0971d48eab4bb7f1f7df09c0e,
title = "Incorporating great deluge approach with kempe chain neighbourhood structure for curriculum-based course timetabling problems",
abstract = "Constructing university course timetable is a very difficult task where a set of events has to be scheduled in timeslots and located in suitable rooms. The objective of course timetabling problem is to satisfy the hard constraints and minimize the violation of soft constraints. In this paper, a hybridization of great deluge algorithm with kempe chain neighbourhood structure is employed. The problem is solved in two steps: a graph-based heuristic is used to construct a feasible timetable in the first step, and the improvement is carried out by employing a hybrid approach in the second step. The approach is tested on the curriculum-based course timetabling problems as described in the 2nd International Timetabling Competition (ITC2007). We present the result of our technique in relation to the competition results that show the proposed approach is able to produce promising results for the university course timetabling problem.",
keywords = "Course timetabling, Great Deluge, Hybrid heuristic, Kempe chain",
author = "Khalid Shaker and Salwani Abdullah",
year = "2009",
doi = "10.1109/DMO.2009.5341894",
language = "English",
isbn = "9781424449446",
pages = "149--153",
booktitle = "2009 2nd Conference on Data Mining and Optimization, DMO 2009",

}

TY - GEN

T1 - Incorporating great deluge approach with kempe chain neighbourhood structure for curriculum-based course timetabling problems

AU - Shaker, Khalid

AU - Abdullah, Salwani

PY - 2009

Y1 - 2009

N2 - Constructing university course timetable is a very difficult task where a set of events has to be scheduled in timeslots and located in suitable rooms. The objective of course timetabling problem is to satisfy the hard constraints and minimize the violation of soft constraints. In this paper, a hybridization of great deluge algorithm with kempe chain neighbourhood structure is employed. The problem is solved in two steps: a graph-based heuristic is used to construct a feasible timetable in the first step, and the improvement is carried out by employing a hybrid approach in the second step. The approach is tested on the curriculum-based course timetabling problems as described in the 2nd International Timetabling Competition (ITC2007). We present the result of our technique in relation to the competition results that show the proposed approach is able to produce promising results for the university course timetabling problem.

AB - Constructing university course timetable is a very difficult task where a set of events has to be scheduled in timeslots and located in suitable rooms. The objective of course timetabling problem is to satisfy the hard constraints and minimize the violation of soft constraints. In this paper, a hybridization of great deluge algorithm with kempe chain neighbourhood structure is employed. The problem is solved in two steps: a graph-based heuristic is used to construct a feasible timetable in the first step, and the improvement is carried out by employing a hybrid approach in the second step. The approach is tested on the curriculum-based course timetabling problems as described in the 2nd International Timetabling Competition (ITC2007). We present the result of our technique in relation to the competition results that show the proposed approach is able to produce promising results for the university course timetabling problem.

KW - Course timetabling

KW - Great Deluge

KW - Hybrid heuristic

KW - Kempe chain

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

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

U2 - 10.1109/DMO.2009.5341894

DO - 10.1109/DMO.2009.5341894

M3 - Conference contribution

AN - SCOPUS:72449158686

SN - 9781424449446

SP - 149

EP - 153

BT - 2009 2nd Conference on Data Mining and Optimization, DMO 2009

ER -