A differential evolution algorithm for the university course timetabling problem

Khalid Shaker, Salwani Abdullah, Arwa Hatem

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

1 Citation (Scopus)

Abstract

The University course timetabling problem is known as a NP-hard problem. It is a complex problem wherein the problem size can become huge due to limited resources (e.g. amount of rooms, their capacities and number availability of lecturers) and the requirements for these resources. The university course timetabling problem involves assigning a given number of events to a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints and minimize the violation of soft constraints. In this paper, a Differential Evolution (DE) algorithm is proposed. DE algorithm relies on the mutation operation to reduce the convergence time while reducing the penalty cost of solution. The proposed algorithm 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 publicationConference on Data Mining and Optimization
Pages99-102
Number of pages4
DOIs
Publication statusPublished - 2012
Event2012 4th Conference on Data Mining and Optimization, DMO 2012 - Langkawi
Duration: 2 Sep 20124 Sep 2012

Other

Other2012 4th Conference on Data Mining and Optimization, DMO 2012
CityLangkawi
Period2/9/124/9/12

Fingerprint

Computational complexity
Availability
Costs

Keywords

  • course timetabling
  • differential evolution

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Shaker, K., Abdullah, S., & Hatem, A. (2012). A differential evolution algorithm for the university course timetabling problem. In Conference on Data Mining and Optimization (pp. 99-102). [6329805] https://doi.org/10.1109/DMO.2012.6329805

A differential evolution algorithm for the university course timetabling problem. / Shaker, Khalid; Abdullah, Salwani; Hatem, Arwa.

Conference on Data Mining and Optimization. 2012. p. 99-102 6329805.

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

Shaker, K, Abdullah, S & Hatem, A 2012, A differential evolution algorithm for the university course timetabling problem. in Conference on Data Mining and Optimization., 6329805, pp. 99-102, 2012 4th Conference on Data Mining and Optimization, DMO 2012, Langkawi, 2/9/12. https://doi.org/10.1109/DMO.2012.6329805
Shaker K, Abdullah S, Hatem A. A differential evolution algorithm for the university course timetabling problem. In Conference on Data Mining and Optimization. 2012. p. 99-102. 6329805 https://doi.org/10.1109/DMO.2012.6329805
Shaker, Khalid ; Abdullah, Salwani ; Hatem, Arwa. / A differential evolution algorithm for the university course timetabling problem. Conference on Data Mining and Optimization. 2012. pp. 99-102
@inproceedings{858ad96563aa4046ac272bd5a4fb1039,
title = "A differential evolution algorithm for the university course timetabling problem",
abstract = "The University course timetabling problem is known as a NP-hard problem. It is a complex problem wherein the problem size can become huge due to limited resources (e.g. amount of rooms, their capacities and number availability of lecturers) and the requirements for these resources. The university course timetabling problem involves assigning a given number of events to a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints and minimize the violation of soft constraints. In this paper, a Differential Evolution (DE) algorithm is proposed. DE algorithm relies on the mutation operation to reduce the convergence time while reducing the penalty cost of solution. The proposed algorithm 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, differential evolution",
author = "Khalid Shaker and Salwani Abdullah and Arwa Hatem",
year = "2012",
doi = "10.1109/DMO.2012.6329805",
language = "English",
isbn = "9781467327183",
pages = "99--102",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - A differential evolution algorithm for the university course timetabling problem

AU - Shaker, Khalid

AU - Abdullah, Salwani

AU - Hatem, Arwa

PY - 2012

Y1 - 2012

N2 - The University course timetabling problem is known as a NP-hard problem. It is a complex problem wherein the problem size can become huge due to limited resources (e.g. amount of rooms, their capacities and number availability of lecturers) and the requirements for these resources. The university course timetabling problem involves assigning a given number of events to a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints and minimize the violation of soft constraints. In this paper, a Differential Evolution (DE) algorithm is proposed. DE algorithm relies on the mutation operation to reduce the convergence time while reducing the penalty cost of solution. The proposed algorithm 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 - The University course timetabling problem is known as a NP-hard problem. It is a complex problem wherein the problem size can become huge due to limited resources (e.g. amount of rooms, their capacities and number availability of lecturers) and the requirements for these resources. The university course timetabling problem involves assigning a given number of events to a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints and minimize the violation of soft constraints. In this paper, a Differential Evolution (DE) algorithm is proposed. DE algorithm relies on the mutation operation to reduce the convergence time while reducing the penalty cost of solution. The proposed algorithm 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 - differential evolution

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

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

U2 - 10.1109/DMO.2012.6329805

DO - 10.1109/DMO.2012.6329805

M3 - Conference contribution

AN - SCOPUS:84869443738

SN - 9781467327183

SP - 99

EP - 102

BT - Conference on Data Mining and Optimization

ER -