Application of the grouping genetic algorithm to university course timetabling

Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X and Paechter, Ben 2005. Application of the grouping genetic algorithm to university course timetabling. Lecture Notes in Computer Science 3448 , pp. 144-153. 10.1007/978-3-540-31996-2_14

Full text not available from this repository.

Abstract

University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we note that the satisfaction of hard constraints fits the standard definition of a grouping problem. As a result, a grouping genetic algorithm for finding feasible timetables for “hard” problem instances has been developed, with promising results.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Schools > Mathematics
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer Verlag
ISSN:	0302-9743
Related URLs:	Publisher
Last Modified:	20 Oct 2022 08:15
URI:	https://orca.cardiff.ac.uk/id/eprint/27754

Citation Data

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

Actions (repository staff only)

Edit Item