A hybrid evolutionary approach to the university course timetabling problem

Salwani Abdullah, Edmund K. Burke, Barry McCollum

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

66 Citations (Scopus)

Abstract

Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such an algorithm for university course timetabling. This problem is concerned with the assignment of lectures to specific timeslots and rooms. For a solution to be feasible, a number of hard constraints must be satisfied. The quality of the solution is measured in terms of a penalty value which represents the degree to which various soft constraints are satisfied. This hybrid evolutionary approach is tested over established datasets and compared against state-of-the-art techniques from the literature. The results obtained confirm that the approach Is able to produce solutions to the course timetabling problem which exhibit some of the lowest penalty values in the literature on these benchmark problems. It is therefore concluded that the hybrid evolutionary approach represents a particularly effective methodology for producing high quality solutions to the university course timetabling problem.

Original languageEnglish
Title of host publication2007 IEEE Congress on Evolutionary Computation, CEC 2007
Pages1764-1768
Number of pages5
DOIs
Publication statusPublished - 2007
Event2007 IEEE Congress on Evolutionary Computation, CEC 2007 -
Duration: 25 Sep 200728 Sep 2007

Other

Other2007 IEEE Congress on Evolutionary Computation, CEC 2007
Period25/9/0728/9/07

Fingerprint

Timetabling
Penalty
Soft Constraints
Local Search
Scheduling Problem
Lowest
Assignment
Scheduling
Benchmark
Universities
Methodology

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Theoretical Computer Science

Cite this

Abdullah, S., Burke, E. K., & McCollum, B. (2007). A hybrid evolutionary approach to the university course timetabling problem. In 2007 IEEE Congress on Evolutionary Computation, CEC 2007 (pp. 1764-1768). [4424686] https://doi.org/10.1109/CEC.2007.4424686

A hybrid evolutionary approach to the university course timetabling problem. / Abdullah, Salwani; Burke, Edmund K.; McCollum, Barry.

2007 IEEE Congress on Evolutionary Computation, CEC 2007. 2007. p. 1764-1768 4424686.

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

Abdullah, S, Burke, EK & McCollum, B 2007, A hybrid evolutionary approach to the university course timetabling problem. in 2007 IEEE Congress on Evolutionary Computation, CEC 2007., 4424686, pp. 1764-1768, 2007 IEEE Congress on Evolutionary Computation, CEC 2007, 25/9/07. https://doi.org/10.1109/CEC.2007.4424686
Abdullah S, Burke EK, McCollum B. A hybrid evolutionary approach to the university course timetabling problem. In 2007 IEEE Congress on Evolutionary Computation, CEC 2007. 2007. p. 1764-1768. 4424686 https://doi.org/10.1109/CEC.2007.4424686
Abdullah, Salwani ; Burke, Edmund K. ; McCollum, Barry. / A hybrid evolutionary approach to the university course timetabling problem. 2007 IEEE Congress on Evolutionary Computation, CEC 2007. 2007. pp. 1764-1768
@inproceedings{f5df1ae376704352b7c2b70598c33e2e,
title = "A hybrid evolutionary approach to the university course timetabling problem",
abstract = "Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such an algorithm for university course timetabling. This problem is concerned with the assignment of lectures to specific timeslots and rooms. For a solution to be feasible, a number of hard constraints must be satisfied. The quality of the solution is measured in terms of a penalty value which represents the degree to which various soft constraints are satisfied. This hybrid evolutionary approach is tested over established datasets and compared against state-of-the-art techniques from the literature. The results obtained confirm that the approach Is able to produce solutions to the course timetabling problem which exhibit some of the lowest penalty values in the literature on these benchmark problems. It is therefore concluded that the hybrid evolutionary approach represents a particularly effective methodology for producing high quality solutions to the university course timetabling problem.",
author = "Salwani Abdullah and Burke, {Edmund K.} and Barry McCollum",
year = "2007",
doi = "10.1109/CEC.2007.4424686",
language = "English",
isbn = "1424413400",
pages = "1764--1768",
booktitle = "2007 IEEE Congress on Evolutionary Computation, CEC 2007",

}

TY - GEN

T1 - A hybrid evolutionary approach to the university course timetabling problem

AU - Abdullah, Salwani

AU - Burke, Edmund K.

AU - McCollum, Barry

PY - 2007

Y1 - 2007

N2 - Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such an algorithm for university course timetabling. This problem is concerned with the assignment of lectures to specific timeslots and rooms. For a solution to be feasible, a number of hard constraints must be satisfied. The quality of the solution is measured in terms of a penalty value which represents the degree to which various soft constraints are satisfied. This hybrid evolutionary approach is tested over established datasets and compared against state-of-the-art techniques from the literature. The results obtained confirm that the approach Is able to produce solutions to the course timetabling problem which exhibit some of the lowest penalty values in the literature on these benchmark problems. It is therefore concluded that the hybrid evolutionary approach represents a particularly effective methodology for producing high quality solutions to the university course timetabling problem.

AB - Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such an algorithm for university course timetabling. This problem is concerned with the assignment of lectures to specific timeslots and rooms. For a solution to be feasible, a number of hard constraints must be satisfied. The quality of the solution is measured in terms of a penalty value which represents the degree to which various soft constraints are satisfied. This hybrid evolutionary approach is tested over established datasets and compared against state-of-the-art techniques from the literature. The results obtained confirm that the approach Is able to produce solutions to the course timetabling problem which exhibit some of the lowest penalty values in the literature on these benchmark problems. It is therefore concluded that the hybrid evolutionary approach represents a particularly effective methodology for producing high quality solutions to the university course timetabling problem.

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

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

U2 - 10.1109/CEC.2007.4424686

DO - 10.1109/CEC.2007.4424686

M3 - Conference contribution

SN - 1424413400

SN - 9781424413409

SP - 1764

EP - 1768

BT - 2007 IEEE Congress on Evolutionary Computation, CEC 2007

ER -