Lewis, Rhydian M R and Paechter, Ben (2005) Application of the Grouping Genetic Algorithm to university course timetabling. In: Evolutionary Computation in Combinatorial Optimization. Springer-Verlag, Lausanne, Swizerland, pp. 144-153. ISBN 978-3-540-25337-2

PDF Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial. Download (172kB) | Request a copy

Abstract/Description

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.

Actions (login required)