Application of the Grouping Genetic Algorithm to University Course Timetabling

Lewis, Rhydian; Lewis, Rhydian M R; Paechter, Ben

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.

Citation

Lewis, R., Lewis, R. M. R., & Paechter, B. (2005, March). Application of the Grouping Genetic Algorithm to University Course Timetabling. Presented at 5th European Conference in Evolutionary Computation in Combinatorial Optimisation (EvoCop 2005), Lausanne, Swizerland

• Presentation Conference Type: Conference Paper (Published)
• Conference Name: 5th European Conference in Evolutionary Computation in Combinatorial Optimisation (EvoCop 2005)
• Start Date: Mar 30, 2005
• End Date: Apr 1, 2005
• Publication Date: 2005
• Deposit Date: May 4, 2010
• Electronic ISSN: 1611-3349
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Pages: 144-153
• Series Title: Lecture Notes in Computer Science
• Series Number: 3448
• Series ISSN: 0302-9743
• Book Title: Evolutionary Computation in Combinatorial Optimization
• ISBN: 9783540253372
• DOI: https://doi.org/10.1007/978-3-540-31996-2_14
• Keywords: University Course Timetabling-Problems; grouping geneticalgorithm
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3378
• Publisher URL: http://dx.doi.org/10.1007/978-3-540-31996-2_14