Application of the Grouping Genetic Algorithm to University Course Timetabling (2005)
| Venue: | In G. Raidl and J. Gottlieb (eds) Evolutionary Computation in Combinatorial Optimization, Springer LNCS 3448 |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Lewis05applicationof,
author = {Rhydian Lewis and Ben Paechter},
title = {Application of the Grouping Genetic Algorithm to University Course Timetabling},
booktitle = {In G. Raidl and J. Gottlieb (eds) Evolutionary Computation in Combinatorial Optimization, Springer LNCS 3448},
year = {2005},
pages = {144--153},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
