Lewis, Rhydian M R and Paechter, Ben (2005) Application of the Grouping Genetic Algorithm to university course timetabling. In: Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science , 3448 . Springer Berlin Heidelberg, pp. 144-153. ISBN 978-3-540-25337-2
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial.
Download (172kB) | Request a copy
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:||Book Section|
|Additional Information:||paper presented at 5th European Conference in Evolutionary Computation in Combinatorial Optimisation (EvoCop 2005) Lausanne, Swizerland|
|Uncontrolled Keywords:||University Course Timetabling-Problems; grouping genetic algorithm;|
|University Divisions/Research Centres:||Faculty of Engineering, Computing and Creative Industries > School of Computing|
|Dewey Decimal Subjects:||000 Computer science, information & general works > 000 Computer science, knowledge & systems > 005 Computer programming, programs & data|
|Library of Congress Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Depositing User:||Computing Research|
|Date Deposited:||04 May 2010 16:48|
|Last Modified:||19 Dec 2013 11:09|
Actions (login required)