Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

A survey of metaheuristic-based techniques for university timetabling problems

Lewis, Rhyd 2007. A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30 (1) , pp. 167-190. 10.1007/s00291-007-0097-0

[img]
Preview
Text - Accepted Post-Print Version
Download (406kB) | Preview

Abstract

As well as nearly always belonging to the class of NP-complete problems, university timetabling problems can be further complicated by the often idiosyncratic requirements imposed by the particular institution being considered. It is perhaps due to this characteristic that in the past decade-or-so, metaheuristics have become increasingly popular in the field of automated timetabling. In this paper we carry out an overview of such applications, paying particular attention to the various methods that have been proposed for dealing and differentiating between constraints of varying importance. Our review allows us to classify these algorithms into three general classes, and we make some instructive comments on each of these.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Uncontrolled Keywords: timetabling ; metaheuristics ; constraints.
Publisher: Springer-Verlag
ISSN: 0171-6468
Last Modified: 04 Jun 2017 02:56
URI: http://orca.cf.ac.uk/id/eprint/13966

Citation Data

Cited 204 times in Google Scholar. View in Google Scholar

Cited 144 times in Scopus. View in Scopus. Powered By Scopus® Data

Cited 74 times in Web of Science. View in Web of Science.

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics