A survey of metaheuristic-based techniques for university timetabling problems

Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X 2007. A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30 (1) , pp. 167-190. 10.1007/s00291-007-0097-0

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
Date of First Compliant Deposit:	30 March 2016
Last Modified:	04 May 2023 07:28
URI:	https://orca.cardiff.ac.uk/id/eprint/13966

Citation Data

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

Actions (repository staff only)

Edit Item